./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all.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/list-simple/dll2c_update_all.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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:37:58,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:37:58,310 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:37:58,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:37:58,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:37:58,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:37:58,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:37:58,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:37:58,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:37:58,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:37:58,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:37:58,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:37:58,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:37:58,338 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:37:58,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:37:58,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:37:58,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:37:58,339 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2025-02-06 10:37:58,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:37:58,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:37:58,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:37:58,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:37:58,568 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:37:58,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2025-02-06 10:37:59,706 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74ee393f7/d570e318820f411f93c96d6c49e4d39a/FLAGace0308e2 [2025-02-06 10:37:59,972 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:37:59,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2025-02-06 10:37:59,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74ee393f7/d570e318820f411f93c96d6c49e4d39a/FLAGace0308e2 [2025-02-06 10:38:00,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74ee393f7/d570e318820f411f93c96d6c49e4d39a [2025-02-06 10:38:00,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:38:00,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:38:00,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:38:00,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:38:00,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:38:00,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af18065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00, skipping insertion in model container [2025-02-06 10:38:00,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:38:00,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:38:00,249 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:38:00,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:38:00,292 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:38:00,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00 WrapperNode [2025-02-06 10:38:00,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:38:00,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:38:00,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:38:00,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:38:00,297 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:38:00" (1/1) ... [2025-02-06 10:38:00,304 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:38:00" (1/1) ... [2025-02-06 10:38:00,319 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-02-06 10:38:00,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:38:00,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:38:00,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:38:00,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:38:00,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,344 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2025-02-06 10:38:00,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:38:00,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:38:00,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:38:00,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:38:00,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (1/1) ... [2025-02-06 10:38:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:38:00,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:00,385 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:38:00,387 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:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-06 10:38:00,405 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:38:00,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:38:00,509 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:38:00,511 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:38:00,705 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L617: havoc dll_circular_get_data_at_#t~mem11#1; [2025-02-06 10:38:00,730 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-06 10:38:00,749 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-02-06 10:38:00,750 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:38:00,758 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:38:00,759 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:38:00,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:38:00 BoogieIcfgContainer [2025-02-06 10:38:00,759 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:38:00,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:38:00,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:38:00,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:38:00,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:38:00" (1/3) ... [2025-02-06 10:38:00,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57595c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:38:00, skipping insertion in model container [2025-02-06 10:38:00,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:38:00" (2/3) ... [2025-02-06 10:38:00,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57595c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:38:00, skipping insertion in model container [2025-02-06 10:38:00,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:38:00" (3/3) ... [2025-02-06 10:38:00,770 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2025-02-06 10:38:00,781 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:38:00,783 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_update_all.i that has 2 procedures, 92 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2025-02-06 10:38:00,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:38:00,818 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;@4bd19c2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:38:00,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-02-06 10:38:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 88 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:38:00,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:00,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:38:00,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:00,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash -686067722, now seen corresponding path program 1 times [2025-02-06 10:38:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998107482] [2025-02-06 10:38:00,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:00,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:38:00,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:38:00,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:00,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:00,990 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:38:00,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:00,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998107482] [2025-02-06 10:38:00,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998107482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:00,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:00,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:38:00,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999584194] [2025-02-06 10:38:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:00,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:38:00,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:01,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:38:01,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:38:01,018 INFO L87 Difference]: Start difference. First operand has 92 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 88 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:38:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:01,103 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-02-06 10:38:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:38:01,105 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:38:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:01,110 INFO L225 Difference]: With dead ends: 88 [2025-02-06 10:38:01,110 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:38:01,111 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:38:01,116 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:01,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:38:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-06 10:38:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2025-02-06 10:38:01,149 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 6 [2025-02-06 10:38:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:01,149 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2025-02-06 10:38:01,150 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:38:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2025-02-06 10:38:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:38:01,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:01,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:38:01,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:38:01,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:01,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash -686067721, now seen corresponding path program 1 times [2025-02-06 10:38:01,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:01,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706616208] [2025-02-06 10:38:01,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:01,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:01,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:38:01,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:38:01,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:01,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:01,247 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:38:01,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:01,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706616208] [2025-02-06 10:38:01,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706616208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:01,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:38:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378136310] [2025-02-06 10:38:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:01,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:38:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:01,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:38:01,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:38:01,254 INFO L87 Difference]: Start difference. First operand 85 states and 93 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:38:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:01,299 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-02-06 10:38:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:38:01,300 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:38:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:01,300 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:38:01,300 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:38:01,301 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:38:01,301 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:01,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 148 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:38:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 10:38:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 78 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-02-06 10:38:01,310 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 6 [2025-02-06 10:38:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:01,311 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-02-06 10:38:01,311 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:38:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-02-06 10:38:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:38:01,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:01,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:01,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:38:01,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:01,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 704285978, now seen corresponding path program 1 times [2025-02-06 10:38:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:01,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060299728] [2025-02-06 10:38:01,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:01,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:38:01,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:38:01,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:01,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:01,422 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:38:01,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:01,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060299728] [2025-02-06 10:38:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060299728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:01,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:38:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710068500] [2025-02-06 10:38:01,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:01,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:38:01,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:01,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:38:01,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:38:01,426 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:38:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:01,439 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2025-02-06 10:38:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:38:01,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-06 10:38:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:01,443 INFO L225 Difference]: With dead ends: 93 [2025-02-06 10:38:01,443 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 10:38:01,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:38:01,444 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:01,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 10:38:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2025-02-06 10:38:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2025-02-06 10:38:01,453 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 14 [2025-02-06 10:38:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:01,454 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2025-02-06 10:38:01,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:38:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2025-02-06 10:38:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:38:01,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:01,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:01,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:38:01,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:01,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -141531556, now seen corresponding path program 1 times [2025-02-06 10:38:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540491047] [2025-02-06 10:38:01,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:01,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:38:01,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:38:01,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:01,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:38:01,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:01,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540491047] [2025-02-06 10:38:01,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540491047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:01,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:01,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:38:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359896360] [2025-02-06 10:38:01,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:01,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:38:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:01,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:38:01,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:38:01,608 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:01,719 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-02-06 10:38:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:38:01,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-06 10:38:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:01,721 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:38:01,721 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:38:01,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:38:01,722 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:01,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 280 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:38:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 10:38:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 78 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-02-06 10:38:01,732 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 24 [2025-02-06 10:38:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:01,732 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-02-06 10:38:01,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-02-06 10:38:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:38:01,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:01,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:01,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:38:01,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:01,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:01,735 INFO L85 PathProgramCache]: Analyzing trace with hash -141531555, now seen corresponding path program 1 times [2025-02-06 10:38:01,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:01,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555589974] [2025-02-06 10:38:01,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:01,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:01,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:38:01,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:38:01,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:01,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:01,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:01,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555589974] [2025-02-06 10:38:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555589974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:01,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:38:01,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647051567] [2025-02-06 10:38:01,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:01,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:38:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:01,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:38:01,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:38:01,947 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:02,043 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-02-06 10:38:02,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:38:02,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-06 10:38:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:02,045 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:38:02,045 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:38:02,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:38:02,045 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:02,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 302 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:38:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 10:38:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-02-06 10:38:02,054 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 24 [2025-02-06 10:38:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:02,054 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-02-06 10:38:02,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-02-06 10:38:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:38:02,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:02,055 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:02,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:38:02,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:02,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:02,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1427129753, now seen corresponding path program 1 times [2025-02-06 10:38:02,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:02,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140239224] [2025-02-06 10:38:02,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:02,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:02,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:38:02,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:38:02,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:02,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:02,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140239224] [2025-02-06 10:38:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140239224] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279317894] [2025-02-06 10:38:02,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:02,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:02,287 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:38:02,288 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:38:02,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:38:02,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:38:02,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:02,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:02,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 10:38:02,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:02,402 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:38:02,441 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-06 10:38:02,498 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:38:02,498 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:38:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-06 10:38:02,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:02,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279317894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:02,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-02-06 10:38:02,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903223331] [2025-02-06 10:38:02,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:02,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:38:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:02,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:38:02,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-02-06 10:38:02,557 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:38:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:02,767 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2025-02-06 10:38:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:38:02,770 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-02-06 10:38:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:02,771 INFO L225 Difference]: With dead ends: 86 [2025-02-06 10:38:02,771 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 10:38:02,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-02-06 10:38:02,771 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:02,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 401 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2025-02-06 10:38:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 10:38:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-06 10:38:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.625) internal successors, (91), 81 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:38:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2025-02-06 10:38:02,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 26 [2025-02-06 10:38:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:02,775 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2025-02-06 10:38:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:38:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2025-02-06 10:38:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:38:02,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:02,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:02,783 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:38:02,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:02,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1427129754, now seen corresponding path program 1 times [2025-02-06 10:38:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:02,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54048628] [2025-02-06 10:38:02,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:38:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:38:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:03,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:03,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54048628] [2025-02-06 10:38:03,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54048628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264726071] [2025-02-06 10:38:03,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:03,291 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:38:03,293 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:38:03,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:38:03,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:38:03,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:03,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:03,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:38:03,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:03,405 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:38:03,409 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:38:03,605 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:38:03,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:38:03,619 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:03,620 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:38:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:03,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264726071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:03,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-02-06 10:38:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350000820] [2025-02-06 10:38:03,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:03,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:38:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:03,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:38:03,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:38:03,780 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:04,078 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2025-02-06 10:38:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:38:04,080 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-02-06 10:38:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:04,080 INFO L225 Difference]: With dead ends: 86 [2025-02-06 10:38:04,080 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 10:38:04,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:38:04,081 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:04,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:38:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 10:38:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-06 10:38:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:38:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2025-02-06 10:38:04,090 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 26 [2025-02-06 10:38:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:04,090 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2025-02-06 10:38:04,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2025-02-06 10:38:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:38:04,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:04,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:04,099 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:38:04,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:04,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:04,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1377155880, now seen corresponding path program 1 times [2025-02-06 10:38:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:04,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990448860] [2025-02-06 10:38:04,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:04,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:38:04,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:38:04,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:04,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:04,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990448860] [2025-02-06 10:38:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990448860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819383436] [2025-02-06 10:38:04,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:04,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:04,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:04,364 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:38:04,366 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:38:04,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:38:04,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:38:04,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:04,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:04,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 10:38:04,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:04,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819383436] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:04,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-06 10:38:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028153343] [2025-02-06 10:38:04,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:04,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:38:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:04,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:38:04,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:38:04,485 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:04,518 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2025-02-06 10:38:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:38:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-02-06 10:38:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:04,519 INFO L225 Difference]: With dead ends: 86 [2025-02-06 10:38:04,519 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 10:38:04,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:38:04,519 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:04,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 379 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 10:38:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-06 10:38:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:38:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2025-02-06 10:38:04,523 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 28 [2025-02-06 10:38:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:04,523 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2025-02-06 10:38:04,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2025-02-06 10:38:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:38:04,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:04,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:04,531 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:38:04,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:04,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:04,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:04,726 INFO L85 PathProgramCache]: Analyzing trace with hash -258745434, now seen corresponding path program 1 times [2025-02-06 10:38:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:04,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265285549] [2025-02-06 10:38:04,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:38:04,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:38:04,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:04,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:38:04,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:04,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265285549] [2025-02-06 10:38:04,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265285549] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:04,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966694417] [2025-02-06 10:38:04,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:04,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:04,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:04,792 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:38:04,794 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:38:04,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:38:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:38:04,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:04,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:04,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:38:04,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:04,884 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:38:04,916 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-06 10:38:04,959 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:38:04,960 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:38:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-02-06 10:38:04,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966694417] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:05,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-02-06 10:38:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060239176] [2025-02-06 10:38:05,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:05,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:38:05,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:05,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:38:05,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-02-06 10:38:05,006 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:05,155 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2025-02-06 10:38:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:38:05,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-02-06 10:38:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:05,156 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:38:05,156 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:38:05,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-02-06 10:38:05,157 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 9 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:05,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 418 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 87 Unchecked, 0.1s Time] [2025-02-06 10:38:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:38:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-06 10:38:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:38:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2025-02-06 10:38:05,160 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 29 [2025-02-06 10:38:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:05,160 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2025-02-06 10:38:05,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2025-02-06 10:38:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:38:05,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:05,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:05,169 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:38:05,361 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,SelfDestructingSolverStorable8 [2025-02-06 10:38:05,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:05,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -258745433, now seen corresponding path program 1 times [2025-02-06 10:38:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:05,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555605958] [2025-02-06 10:38:05,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:05,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:05,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:38:05,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:38:05,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:05,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555605958] [2025-02-06 10:38:05,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555605958] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631471212] [2025-02-06 10:38:05,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:05,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:05,515 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:38:05,516 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:38:05,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:38:05,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:38:05,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:05,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:05,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:38:05,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:05,629 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:38:05,637 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:38:05,734 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-06 10:38:05,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:05,767 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:38:05,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:05,774 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:38:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-06 10:38:05,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631471212] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:05,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-02-06 10:38:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604542231] [2025-02-06 10:38:05,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:05,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:38:05,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:05,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:38:05,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-02-06 10:38:05,882 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:06,125 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-02-06 10:38:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:38:06,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-02-06 10:38:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:06,127 INFO L225 Difference]: With dead ends: 102 [2025-02-06 10:38:06,127 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 10:38:06,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2025-02-06 10:38:06,128 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 16 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:06,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 632 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2025-02-06 10:38:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 10:38:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2025-02-06 10:38:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 89 states have internal predecessors, (102), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2025-02-06 10:38:06,133 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2025-02-06 10:38:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:06,133 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2025-02-06 10:38:06,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2025-02-06 10:38:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:38:06,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:06,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:06,140 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:38:06,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 10:38:06,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:06,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:06,335 INFO L85 PathProgramCache]: Analyzing trace with hash 568826178, now seen corresponding path program 1 times [2025-02-06 10:38:06,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:06,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90859618] [2025-02-06 10:38:06,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:06,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:06,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:38:06,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:38:06,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:06,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:38:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90859618] [2025-02-06 10:38:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90859618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:06,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:38:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788752762] [2025-02-06 10:38:06,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:06,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:06,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:06,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:06,404 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:06,502 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2025-02-06 10:38:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:38:06,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-02-06 10:38:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:06,503 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:38:06,503 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:38:06,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:06,505 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:06,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 316 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:38:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 10:38:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 88 states have internal predecessors, (101), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2025-02-06 10:38:06,507 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 30 [2025-02-06 10:38:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:06,507 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2025-02-06 10:38:06,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2025-02-06 10:38:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:38:06,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:06,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:06,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:38:06,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:06,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash 568826179, now seen corresponding path program 1 times [2025-02-06 10:38:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:06,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20601864] [2025-02-06 10:38:06,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:06,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:38:06,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:38:06,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:06,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:06,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20601864] [2025-02-06 10:38:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20601864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:38:06,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966145488] [2025-02-06 10:38:06,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:06,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:06,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:06,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:06,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:06,639 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:06,732 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2025-02-06 10:38:06,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:38:06,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-02-06 10:38:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:06,733 INFO L225 Difference]: With dead ends: 93 [2025-02-06 10:38:06,734 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 10:38:06,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:06,734 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 6 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:06,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 338 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 10:38:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 10:38:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 87 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2025-02-06 10:38:06,740 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 30 [2025-02-06 10:38:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:06,740 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2025-02-06 10:38:06,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2025-02-06 10:38:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:38:06,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:06,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:06,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:38:06,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:06,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2126959041, now seen corresponding path program 1 times [2025-02-06 10:38:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:06,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561964634] [2025-02-06 10:38:06,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:06,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:38:06,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:38:06,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:06,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:06,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:06,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561964634] [2025-02-06 10:38:06,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561964634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:06,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:06,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:38:06,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114153194] [2025-02-06 10:38:06,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:06,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:38:06,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:06,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:38:06,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:38:06,803 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:06,822 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2025-02-06 10:38:06,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:38:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-02-06 10:38:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:06,823 INFO L225 Difference]: With dead ends: 115 [2025-02-06 10:38:06,823 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 10:38:06,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:38:06,823 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 21 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:06,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 231 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 10:38:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2025-02-06 10:38:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.537313432835821) internal successors, (103), 89 states have internal predecessors, (103), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2025-02-06 10:38:06,826 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 35 [2025-02-06 10:38:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:06,826 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2025-02-06 10:38:06,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2025-02-06 10:38:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:38:06,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:06,827 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:06,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:38:06,827 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:06,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2126959068, now seen corresponding path program 1 times [2025-02-06 10:38:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291507017] [2025-02-06 10:38:06,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:06,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:06,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:38:06,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:38:06,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:06,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:38:06,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:06,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291507017] [2025-02-06 10:38:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291507017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:06,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:06,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:38:06,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939297060] [2025-02-06 10:38:06,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:06,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:38:06,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:06,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:38:06,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:06,954 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:07,112 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2025-02-06 10:38:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:38:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-02-06 10:38:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:07,113 INFO L225 Difference]: With dead ends: 98 [2025-02-06 10:38:07,113 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 10:38:07,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:38:07,114 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:07,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 391 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 10:38:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 10:38:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 92 states have internal predecessors, (109), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2025-02-06 10:38:07,116 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 35 [2025-02-06 10:38:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:07,116 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2025-02-06 10:38:07,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2025-02-06 10:38:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:38:07,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:07,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:07,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:38:07,119 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:07,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:07,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2126959069, now seen corresponding path program 1 times [2025-02-06 10:38:07,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:07,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021535040] [2025-02-06 10:38:07,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:07,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:07,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:38:07,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:38:07,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:07,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:07,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:07,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021535040] [2025-02-06 10:38:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021535040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:07,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:07,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:38:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996346897] [2025-02-06 10:38:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:07,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:38:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:07,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:38:07,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:38:07,347 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:07,524 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2025-02-06 10:38:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:38:07,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-02-06 10:38:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:07,525 INFO L225 Difference]: With dead ends: 98 [2025-02-06 10:38:07,526 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 10:38:07,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:38:07,526 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:07,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 449 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:38:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 10:38:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 10:38:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 92 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2025-02-06 10:38:07,530 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 35 [2025-02-06 10:38:07,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:07,531 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2025-02-06 10:38:07,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2025-02-06 10:38:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:38:07,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:07,531 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:07,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:38:07,531 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:07,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1510864394, now seen corresponding path program 1 times [2025-02-06 10:38:07,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:07,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686456258] [2025-02-06 10:38:07,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:07,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:07,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 10:38:07,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:38:07,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:07,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:07,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:07,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686456258] [2025-02-06 10:38:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686456258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:07,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:07,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:38:07,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747529244] [2025-02-06 10:38:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:07,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:38:07,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:07,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:38:07,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:38:07,583 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:07,598 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2025-02-06 10:38:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:38:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-02-06 10:38:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:07,599 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:38:07,599 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 10:38:07,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:38:07,599 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 53 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:07,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 190 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 10:38:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2025-02-06 10:38:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 93 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2025-02-06 10:38:07,602 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 36 [2025-02-06 10:38:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:07,602 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2025-02-06 10:38:07,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2025-02-06 10:38:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:38:07,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:07,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:07,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:38:07,603 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:07,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:07,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1506550309, now seen corresponding path program 1 times [2025-02-06 10:38:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:07,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794085732] [2025-02-06 10:38:07,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:07,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:38:07,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:38:07,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:07,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:38:07,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:07,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794085732] [2025-02-06 10:38:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794085732] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:07,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12971088] [2025-02-06 10:38:07,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:07,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:07,664 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:38:07,665 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:38:07,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:38:07,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:38:07,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:07,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:07,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:38:07,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:07,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:38:07,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:38:07,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12971088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:07,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:38:07,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 10:38:07,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125650529] [2025-02-06 10:38:07,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:07,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:38:07,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:07,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:38:07,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:38:07,811 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:38:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:07,820 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2025-02-06 10:38:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:38:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-02-06 10:38:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:07,821 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:38:07,821 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:38:07,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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:38:07,821 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:07,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:38:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 10:38:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 77 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2025-02-06 10:38:07,823 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 41 [2025-02-06 10:38:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:07,823 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2025-02-06 10:38:07,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:38:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2025-02-06 10:38:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:38:07,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:07,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:07,834 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:38:08,030 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,SelfDestructingSolverStorable16 [2025-02-06 10:38:08,030 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:08,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash -357034790, now seen corresponding path program 1 times [2025-02-06 10:38:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:08,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477789809] [2025-02-06 10:38:08,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:08,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:08,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:38:08,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:38:08,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:08,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:38:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477789809] [2025-02-06 10:38:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477789809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:08,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:08,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:38:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049862200] [2025-02-06 10:38:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:08,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:38:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:08,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:38:08,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:38:08,105 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:08,122 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2025-02-06 10:38:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:38:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-02-06 10:38:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:08,122 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:38:08,122 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:38:08,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:38:08,123 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 14 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:08,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 222 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:38:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2025-02-06 10:38:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 78 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2025-02-06 10:38:08,125 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 40 [2025-02-06 10:38:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:08,125 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2025-02-06 10:38:08,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2025-02-06 10:38:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:38:08,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:08,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:08,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:38:08,126 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:08,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash -357034763, now seen corresponding path program 1 times [2025-02-06 10:38:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947724341] [2025-02-06 10:38:08,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:08,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:08,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:38:08,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:38:08,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:08,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:38:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:08,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947724341] [2025-02-06 10:38:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947724341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:08,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:38:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882061431] [2025-02-06 10:38:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:38:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:08,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:38:08,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:08,237 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:08,373 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2025-02-06 10:38:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:38:08,374 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-02-06 10:38:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:08,374 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:38:08,374 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:38:08,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:38:08,375 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 32 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:08,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 359 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:38:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-06 10:38:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.467741935483871) internal successors, (91), 81 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2025-02-06 10:38:08,379 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 40 [2025-02-06 10:38:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:08,379 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2025-02-06 10:38:08,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2025-02-06 10:38:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:38:08,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:08,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:08,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:38:08,380 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:08,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash -357034762, now seen corresponding path program 1 times [2025-02-06 10:38:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:08,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439463992] [2025-02-06 10:38:08,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:08,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:08,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:38:08,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:38:08,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:08,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439463992] [2025-02-06 10:38:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439463992] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524895742] [2025-02-06 10:38:08,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:08,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:08,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:08,484 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:38:08,485 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:38:08,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:38:08,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:38:08,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:08,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:08,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:38:08,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:08,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:08,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524895742] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:08,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:08,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 10:38:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64191404] [2025-02-06 10:38:08,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:08,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:38:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:08,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:38:08,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:08,703 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:38:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:08,731 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2025-02-06 10:38:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:38:08,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-02-06 10:38:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:08,732 INFO L225 Difference]: With dead ends: 98 [2025-02-06 10:38:08,732 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 10:38:08,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:08,733 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 90 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:08,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 275 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 10:38:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2025-02-06 10:38:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2025-02-06 10:38:08,735 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 40 [2025-02-06 10:38:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:08,736 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2025-02-06 10:38:08,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:38:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2025-02-06 10:38:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:38:08,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:08,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:08,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:38:08,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:08,937 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:08,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash 811386136, now seen corresponding path program 1 times [2025-02-06 10:38:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:08,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531761145] [2025-02-06 10:38:08,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:08,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:08,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:38:08,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:38:08,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:08,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531761145] [2025-02-06 10:38:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531761145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750685216] [2025-02-06 10:38:09,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:09,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:09,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:09,012 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:38:09,013 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:38:09,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:38:09,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:38:09,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:09,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:09,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:38:09,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:09,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750685216] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:09,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:09,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-06 10:38:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586741339] [2025-02-06 10:38:09,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:09,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:09,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:09,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:09,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:09,191 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:09,231 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-02-06 10:38:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:38:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-02-06 10:38:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:09,232 INFO L225 Difference]: With dead ends: 125 [2025-02-06 10:38:09,232 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 10:38:09,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:09,232 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 34 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:09,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 311 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 10:38:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2025-02-06 10:38:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2025-02-06 10:38:09,234 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 42 [2025-02-06 10:38:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:09,234 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2025-02-06 10:38:09,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2025-02-06 10:38:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:38:09,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:09,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:09,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:38:09,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:09,436 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:09,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash 811386163, now seen corresponding path program 1 times [2025-02-06 10:38:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:09,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749089842] [2025-02-06 10:38:09,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:09,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:38:09,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:38:09,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:09,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:09,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749089842] [2025-02-06 10:38:09,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749089842] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072917454] [2025-02-06 10:38:09,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:09,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:09,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:09,963 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:38:09,964 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:38:10,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:38:10,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:38:10,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:10,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:10,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-06 10:38:10,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:10,116 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:38:10,184 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:10,184 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:38:10,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:38:10,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:38:10,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:38:10,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-06 10:38:10,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:10,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:10,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:10,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2025-02-06 10:38:10,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:10,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2025-02-06 10:38:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:10,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:18,883 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1703 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1703) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2025-02-06 10:38:18,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1703 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1703) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2025-02-06 10:38:18,898 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2025-02-06 10:38:18,899 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 22 treesize of output 21 [2025-02-06 10:38:18,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:18,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2025-02-06 10:38:18,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2025-02-06 10:38:18,969 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 24 treesize of output 20 [2025-02-06 10:38:18,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:38:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-06 10:38:19,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072917454] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:19,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:19,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 47 [2025-02-06 10:38:19,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767066186] [2025-02-06 10:38:19,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:19,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 10:38:19,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:19,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 10:38:19,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1934, Unknown=17, NotChecked=178, Total=2256 [2025-02-06 10:38:19,284 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 48 states, 47 states have (on average 1.872340425531915) internal successors, (88), 41 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:38:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:20,343 INFO L93 Difference]: Finished difference Result 140 states and 166 transitions. [2025-02-06 10:38:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:38:20,346 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.872340425531915) internal successors, (88), 41 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2025-02-06 10:38:20,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:20,347 INFO L225 Difference]: With dead ends: 140 [2025-02-06 10:38:20,347 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 10:38:20,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=215, Invalid=3198, Unknown=17, NotChecked=230, Total=3660 [2025-02-06 10:38:20,349 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 121 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:20,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1346 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1170 Invalid, 0 Unknown, 161 Unchecked, 0.7s Time] [2025-02-06 10:38:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 10:38:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2025-02-06 10:38:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 102 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2025-02-06 10:38:20,355 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 42 [2025-02-06 10:38:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:20,356 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2025-02-06 10:38:20,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.872340425531915) internal successors, (88), 41 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:38:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2025-02-06 10:38:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:38:20,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:20,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:20,363 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:38:20,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:20,557 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:20,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:20,557 INFO L85 PathProgramCache]: Analyzing trace with hash 811386164, now seen corresponding path program 1 times [2025-02-06 10:38:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:20,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623554191] [2025-02-06 10:38:20,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:20,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:38:20,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:38:20,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:20,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:21,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623554191] [2025-02-06 10:38:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623554191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:21,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000738216] [2025-02-06 10:38:21,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:21,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:21,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:21,465 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:38:21,466 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:38:21,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:38:21,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:38:21,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:21,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:21,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-06 10:38:21,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:21,618 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:38:21,622 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:38:21,840 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:38:21,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:38:21,851 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:21,852 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:38:21,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:38:21,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:38:21,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:38:21,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:38:22,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:38:22,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:38:22,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:38:22,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-06 10:38:22,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:22,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:38:22,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:22,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:22,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2025-02-06 10:38:22,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 16 [2025-02-06 10:38:22,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:38:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:22,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:22,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1865 (Array Int Int))) (or (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1865) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_1865 (store .cse0 .cse1 (select v_ArrVal_1865 .cse1)))))) (forall ((v_ArrVal_1865 (Array Int Int))) (or (forall ((v_ArrVal_1866 Int)) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1865) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_1866)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= v_ArrVal_1865 (store .cse0 .cse1 (select v_ArrVal_1865 .cse1)))))))) is different from false [2025-02-06 10:38:23,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:23,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2025-02-06 10:38:23,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:23,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-02-06 10:38:23,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 108 [2025-02-06 10:38:23,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 670 treesize of output 634 [2025-02-06 10:38:23,093 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 70 treesize of output 66 [2025-02-06 10:38:23,095 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 66 treesize of output 62 [2025-02-06 10:38:23,099 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 32 treesize of output 30 [2025-02-06 10:38:23,103 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 30 treesize of output 28 [2025-02-06 10:38:23,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:23,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-02-06 10:38:23,129 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:23,129 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:23,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 10:38:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000738216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:23,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2025-02-06 10:38:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108552405] [2025-02-06 10:38:23,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:23,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 10:38:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:23,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 10:38:23,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2710, Unknown=3, NotChecked=104, Total=2970 [2025-02-06 10:38:23,349 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 37 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:24,501 INFO L93 Difference]: Finished difference Result 149 states and 178 transitions. [2025-02-06 10:38:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:38:24,502 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 37 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2025-02-06 10:38:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:24,502 INFO L225 Difference]: With dead ends: 149 [2025-02-06 10:38:24,502 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 10:38:24,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=255, Invalid=4302, Unknown=3, NotChecked=132, Total=4692 [2025-02-06 10:38:24,503 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 116 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:24,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1403 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:38:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 10:38:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 113. [2025-02-06 10:38:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 109 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2025-02-06 10:38:24,506 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 42 [2025-02-06 10:38:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:24,506 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2025-02-06 10:38:24,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 37 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2025-02-06 10:38:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:38:24,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:24,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:24,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 10:38:24,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 10:38:24,711 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:24,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1172952300, now seen corresponding path program 2 times [2025-02-06 10:38:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111893585] [2025-02-06 10:38:24,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:38:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:24,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 10:38:24,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 44 statements. [2025-02-06 10:38:24,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:38:24,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:38:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111893585] [2025-02-06 10:38:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111893585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:24,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:38:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674588293] [2025-02-06 10:38:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:24,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:38:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:24,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:38:24,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:24,851 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:24,966 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2025-02-06 10:38:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:38:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-02-06 10:38:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:24,966 INFO L225 Difference]: With dead ends: 113 [2025-02-06 10:38:24,966 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 10:38:24,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:38:24,967 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:24,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 416 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 10:38:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-06 10:38:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 109 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2025-02-06 10:38:24,969 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 44 [2025-02-06 10:38:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:24,969 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2025-02-06 10:38:24,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2025-02-06 10:38:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:38:24,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:24,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:24,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:38:24,970 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:24,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2008698399, now seen corresponding path program 2 times [2025-02-06 10:38:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:24,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902345337] [2025-02-06 10:38:24,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:38:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:24,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-06 10:38:24,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:38:24,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:38:24,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:38:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902345337] [2025-02-06 10:38:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902345337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755972246] [2025-02-06 10:38:25,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:38:25,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:25,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:25,040 INFO L229 MonitoredProcess]: Starting monitored process 12 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:38:25,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:38:25,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-06 10:38:25,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:38:25,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:38:25,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:25,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:38:25,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:38:25,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:38:25,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755972246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:25,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:38:25,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-02-06 10:38:25,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603534817] [2025-02-06 10:38:25,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:25,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:38:25,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:25,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:38:25,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:38:25,503 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:25,519 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2025-02-06 10:38:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:38:25,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2025-02-06 10:38:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:25,520 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:38:25,520 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:38:25,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:38:25,520 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 50 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 168 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:38:25,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 168 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:38:25,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2025-02-06 10:38:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 83 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2025-02-06 10:38:25,523 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 49 [2025-02-06 10:38:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:25,523 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2025-02-06 10:38:25,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2025-02-06 10:38:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:38:25,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:25,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:25,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 10:38:25,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 10:38:25,724 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:25,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash 52590991, now seen corresponding path program 1 times [2025-02-06 10:38:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965705817] [2025-02-06 10:38:25,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:25,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:38:25,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:38:25,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:25,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:25,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:25,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965705817] [2025-02-06 10:38:25,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965705817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:25,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616339538] [2025-02-06 10:38:25,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:25,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:25,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:25,830 INFO L229 MonitoredProcess]: Starting monitored process 13 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:38:25,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:38:25,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:38:25,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:38:25,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:25,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:25,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:38:25,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:26,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:26,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616339538] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:26,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:26,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 10:38:26,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730256637] [2025-02-06 10:38:26,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:26,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:26,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:26,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:26,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:26,033 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:26,065 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-02-06 10:38:26,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:38:26,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-02-06 10:38:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:26,066 INFO L225 Difference]: With dead ends: 91 [2025-02-06 10:38:26,066 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 10:38:26,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:26,067 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 47 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:26,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 355 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 10:38:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2025-02-06 10:38:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 83 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2025-02-06 10:38:26,068 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 50 [2025-02-06 10:38:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:26,068 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2025-02-06 10:38:26,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2025-02-06 10:38:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:38:26,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:26,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:26,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-06 10:38:26,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:26,277 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:26,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash -489336262, now seen corresponding path program 1 times [2025-02-06 10:38:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374930702] [2025-02-06 10:38:26,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:26,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:38:26,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:38:26,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:26,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:27,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:27,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374930702] [2025-02-06 10:38:27,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374930702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:27,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347906249] [2025-02-06 10:38:27,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:27,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:27,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:27,496 INFO L229 MonitoredProcess]: Starting monitored process 14 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:38:27,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:38:27,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:38:27,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:38:27,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:27,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:27,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-02-06 10:38:27,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:27,687 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:38:27,831 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:27,831 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:38:27,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:38:27,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:38:27,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:38:28,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-02-06 10:38:28,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:38:28,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2025-02-06 10:38:28,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2025-02-06 10:38:28,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 10:38:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:28,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:28,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2413 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_2413) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2025-02-06 10:38:28,767 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2413 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_2413) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2025-02-06 10:38:28,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2413 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2413) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2025-02-06 10:38:28,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:28,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-02-06 10:38:28,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:28,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 63 [2025-02-06 10:38:28,790 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 25 treesize of output 21 [2025-02-06 10:38:29,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2406) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2025-02-06 10:38:29,049 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2405) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2406) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2025-02-06 10:38:29,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:29,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-06 10:38:29,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-02-06 10:38:29,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-06 10:38:29,064 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 6 treesize of output 4 [2025-02-06 10:38:29,067 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 6 treesize of output 4 [2025-02-06 10:38:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-02-06 10:38:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347906249] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:29,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 77 [2025-02-06 10:38:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516968150] [2025-02-06 10:38:29,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:29,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-02-06 10:38:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:29,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-02-06 10:38:29,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4853, Unknown=33, NotChecked=720, Total=5852 [2025-02-06 10:38:29,416 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 77 states, 76 states have (on average 1.6973684210526316) internal successors, (129), 69 states have internal predecessors, (129), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:38:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:31,083 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-02-06 10:38:31,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:38:31,084 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.6973684210526316) internal successors, (129), 69 states have internal predecessors, (129), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2025-02-06 10:38:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:31,084 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:38:31,084 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 10:38:31,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1785 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=483, Invalid=8245, Unknown=34, NotChecked=940, Total=9702 [2025-02-06 10:38:31,086 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 91 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:31,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1916 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1455 Invalid, 0 Unknown, 287 Unchecked, 0.7s Time] [2025-02-06 10:38:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 10:38:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 10:38:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-02-06 10:38:31,089 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 53 [2025-02-06 10:38:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:31,089 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-02-06 10:38:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.6973684210526316) internal successors, (129), 69 states have internal predecessors, (129), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:38:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-02-06 10:38:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:38:31,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:31,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:31,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 10:38:31,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:31,290 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:31,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1857680567, now seen corresponding path program 1 times [2025-02-06 10:38:31,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:31,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549653768] [2025-02-06 10:38:31,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:31,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:31,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:38:31,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:38:31,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:31,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:38:31,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:31,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549653768] [2025-02-06 10:38:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549653768] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861932173] [2025-02-06 10:38:31,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:31,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:31,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:31,401 INFO L229 MonitoredProcess]: Starting monitored process 15 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:38:31,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:38:31,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:38:31,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:38:31,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:31,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:31,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:38:31,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:38:31,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:38:31,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861932173] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:31,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:31,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-06 10:38:31,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695836271] [2025-02-06 10:38:31,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:31,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:31,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:31,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:38:31,655 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:31,684 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2025-02-06 10:38:31,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:38:31,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-02-06 10:38:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:31,685 INFO L225 Difference]: With dead ends: 84 [2025-02-06 10:38:31,685 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 10:38:31,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:31,685 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:31,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 314 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 10:38:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-06 10:38:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2025-02-06 10:38:31,687 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 56 [2025-02-06 10:38:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:31,687 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2025-02-06 10:38:31,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2025-02-06 10:38:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:38:31,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:31,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:31,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 10:38:31,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 10:38:31,889 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:31,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1857680540, now seen corresponding path program 1 times [2025-02-06 10:38:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:31,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517053149] [2025-02-06 10:38:31,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:31,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:38:31,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:38:31,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:31,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:32,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:32,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517053149] [2025-02-06 10:38:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517053149] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:32,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9887446] [2025-02-06 10:38:32,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:32,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:32,673 INFO L229 MonitoredProcess]: Starting monitored process 16 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:38:32,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:38:32,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:38:32,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:38:32,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:32,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:32,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-06 10:38:32,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:32,859 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:38:32,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:32,917 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:38:32,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:38:33,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:38:33,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:38:33,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-06 10:38:33,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:33,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:33,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:33,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2025-02-06 10:38:33,346 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:38:33,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 42 [2025-02-06 10:38:33,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:33,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2025-02-06 10:38:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:38:33,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:33,459 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2728 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2728) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2025-02-06 10:38:33,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2728 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2728) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2025-02-06 10:38:33,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2726 Int) (v_ArrVal_2728 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_2726)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2728)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2025-02-06 10:38:55,800 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2723 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_2726 Int) (v_ArrVal_2728 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2723))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| 8) v_ArrVal_2726)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2728))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2025-02-06 10:38:55,816 INFO L349 Elim1Store]: treesize reduction 5, result has 90.4 percent of original size [2025-02-06 10:38:55,817 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 56 treesize of output 55 [2025-02-06 10:38:55,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_2723 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2726 Int) (v_ArrVal_2728 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2722) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2723))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| 8) v_ArrVal_2726)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2728))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2025-02-06 10:38:55,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:55,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 66 [2025-02-06 10:38:55,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 445 treesize of output 431 [2025-02-06 10:38:55,850 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:55,853 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 191 treesize of output 185 [2025-02-06 10:38:55,857 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:55,858 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 181 treesize of output 173 [2025-02-06 10:38:55,862 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:55,863 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 121 treesize of output 109 [2025-02-06 10:38:55,871 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 38 treesize of output 36 [2025-02-06 10:38:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-02-06 10:38:56,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9887446] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:56,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:56,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 26] total 60 [2025-02-06 10:38:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748887406] [2025-02-06 10:38:56,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:56,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-02-06 10:38:56,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:56,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-02-06 10:38:56,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2684, Unknown=222, NotChecked=560, Total=3660 [2025-02-06 10:38:56,171 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 61 states, 60 states have (on average 2.033333333333333) internal successors, (122), 54 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:38:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:58,073 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2025-02-06 10:38:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:38:58,074 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.033333333333333) internal successors, (122), 54 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 56 [2025-02-06 10:38:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:58,074 INFO L225 Difference]: With dead ends: 83 [2025-02-06 10:38:58,074 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 10:38:58,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=314, Invalid=4437, Unknown=239, NotChecked=710, Total=5700 [2025-02-06 10:38:58,075 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 56 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:58,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1372 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1179 Invalid, 0 Unknown, 281 Unchecked, 0.6s Time] [2025-02-06 10:38:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 10:38:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-06 10:38:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 79 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2025-02-06 10:38:58,077 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 56 [2025-02-06 10:38:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:58,078 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2025-02-06 10:38:58,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.033333333333333) internal successors, (122), 54 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:38:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2025-02-06 10:38:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:38:58,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:58,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:58,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 10:38:58,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 10:38:58,279 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:38:58,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1857680539, now seen corresponding path program 1 times [2025-02-06 10:38:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:58,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10990557] [2025-02-06 10:38:58,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:58,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:38:58,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:38:58,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:58,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:59,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10990557] [2025-02-06 10:38:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10990557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856648447] [2025-02-06 10:38:59,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:59,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:59,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:59,362 INFO L229 MonitoredProcess]: Starting monitored process 17 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:38:59,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:38:59,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:38:59,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:38:59,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:59,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:59,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-02-06 10:38:59,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:59,568 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:38:59,573 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:38:59,802 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:38:59,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:38:59,812 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:59,812 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:38:59,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:38:59,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:38:59,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:38:59,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:39:00,043 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:00,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 10:39:00,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:39:00,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:39:00,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:39:00,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:00,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:39:00,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:00,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:39:00,372 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:00,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 10:39:00,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:39:00,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:39:00,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:39:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:39:00,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:00,862 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2901 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2900) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2025-02-06 10:39:00,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_2901 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2900) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2025-02-06 10:39:00,906 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2899 (Array Int Int))) (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2897 Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2899) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_2897)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (not (= (store .cse2 .cse1 (select v_ArrVal_2899 .cse1)) v_ArrVal_2899)))) (forall ((v_ArrVal_2899 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_2899 .cse1)) v_ArrVal_2899)) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2897 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_2897)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2899) .cse3 v_ArrVal_2901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2900) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))) is different from false [2025-02-06 10:39:00,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (forall ((v_ArrVal_2899 (Array Int Int))) (or (forall ((v_ArrVal_2901 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2899) .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (store .cse1 .cse2 (select v_ArrVal_2899 .cse2))) v_ArrVal_2899)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (forall ((v_ArrVal_2899 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (or (not (= (store .cse1 .cse3 (select v_ArrVal_2899 .cse3)) v_ArrVal_2899)) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2897 Int)) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2899) .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse4 .cse3 v_ArrVal_2897)) .cse0 v_ArrVal_2900) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2025-02-06 10:39:00,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse0 (select .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (forall ((v_ArrVal_2899 (Array Int Int))) (or (forall ((v_ArrVal_2901 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2899) .cse0 v_ArrVal_2901) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8))) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (store .cse1 .cse2 (select v_ArrVal_2899 .cse2))) v_ArrVal_2899)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_2899 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (or (not (= (store .cse1 .cse3 (select v_ArrVal_2899 .cse3)) v_ArrVal_2899)) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2897 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2899) .cse0 v_ArrVal_2901) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse4 .cse3 v_ArrVal_2897)) .cse0 v_ArrVal_2900) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))))))))) is different from false [2025-02-06 10:39:00,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2899 (Array Int Int))) (or (not (= v_ArrVal_2899 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (store .cse0 .cse1 (select v_ArrVal_2899 .cse1))))) (forall ((v_ArrVal_2901 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2899) .cse2 v_ArrVal_2901) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2899 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (or (not (= v_ArrVal_2899 (store .cse0 .cse3 (select v_ArrVal_2899 .cse3)))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2897 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2899) .cse2 v_ArrVal_2901) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 .cse3 v_ArrVal_2897)) .cse2 v_ArrVal_2900) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))))))) is different from false [2025-02-06 10:39:01,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2896 Int) (v_ArrVal_2897 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (or (not (= (store (store .cse0 .cse1 (select v_ArrVal_2899 .cse1)) .cse2 (select v_ArrVal_2899 .cse2)) v_ArrVal_2899)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2899) .cse3 v_ArrVal_2901) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 11) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store .cse4 .cse1 v_ArrVal_2896) .cse2 v_ArrVal_2897)) .cse3 v_ArrVal_2900) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| Int)) (or (not (= (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| 8))) (store (store .cse0 .cse1 (select v_ArrVal_2899 .cse1)) .cse5 (select v_ArrVal_2899 .cse5))) v_ArrVal_2899)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2899) .cse3 v_ArrVal_2901) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 9)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_51| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2025-02-06 10:39:01,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:01,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 222 [2025-02-06 10:39:01,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:01,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 178 [2025-02-06 10:39:01,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 485 [2025-02-06 10:39:01,612 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,615 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 227 treesize of output 219 [2025-02-06 10:39:01,621 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,623 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 185 treesize of output 179 [2025-02-06 10:39:01,626 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,629 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 159 treesize of output 147 [2025-02-06 10:39:01,635 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 44 treesize of output 42 [2025-02-06 10:39:01,642 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 42 treesize of output 40 [2025-02-06 10:39:01,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2025-02-06 10:39:01,657 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:01,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 107 [2025-02-06 10:39:01,674 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:01,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 89 [2025-02-06 10:39:01,690 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,691 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:01,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 81 [2025-02-06 10:39:01,731 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 10:39:01,754 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 10:39:01,765 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 10:39:01,780 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 10:39:01,796 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,797 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2025-02-06 10:39:01,807 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,808 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2025-02-06 10:39:01,816 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 25 treesize of output 21 [2025-02-06 10:39:01,827 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,828 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:01,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 98 [2025-02-06 10:39:01,851 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,851 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-02-06 10:39:01,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:01,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2025-02-06 10:39:01,864 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,864 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 10:39:01,874 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,874 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:01,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:39:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856648447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:02,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:39:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 44 [2025-02-06 10:39:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121101766] [2025-02-06 10:39:02,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:02,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 10:39:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:02,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 10:39:02,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2971, Unknown=55, NotChecked=812, Total=4032 [2025-02-06 10:39:02,079 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 45 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 40 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:39:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:03,015 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2025-02-06 10:39:03,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:39:03,015 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 40 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2025-02-06 10:39:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:03,016 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:39:03,016 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:39:03,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=300, Invalid=4638, Unknown=60, NotChecked=1008, Total=6006 [2025-02-06 10:39:03,017 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 38 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:03,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1200 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:39:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:39:03,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-02-06 10:39:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 77 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:39:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-02-06 10:39:03,020 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 56 [2025-02-06 10:39:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:03,020 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-02-06 10:39:03,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 40 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:39:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-02-06 10:39:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 10:39:03,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:03,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:03,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 10:39:03,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:03,221 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:39:03,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:03,221 INFO L85 PathProgramCache]: Analyzing trace with hash 854575453, now seen corresponding path program 1 times [2025-02-06 10:39:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:03,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141121420] [2025-02-06 10:39:03,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:03,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:03,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:39:03,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:39:03,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:03,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:39:03,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:03,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141121420] [2025-02-06 10:39:03,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141121420] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:03,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939785542] [2025-02-06 10:39:03,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:03,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:03,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:03,283 INFO L229 MonitoredProcess]: Starting monitored process 18 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:39:03,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:39:03,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:39:03,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:39:03,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:03,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:03,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:39:03,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:39:03,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:39:03,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939785542] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:03,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:03,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-06 10:39:03,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904420072] [2025-02-06 10:39:03,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:03,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:39:03,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:03,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:39:03,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:39:03,545 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:03,568 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2025-02-06 10:39:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:39:03,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2025-02-06 10:39:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:03,569 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:39:03,569 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:39:03,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:39:03,569 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:03,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 255 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:39:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:39:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 10:39:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.196969696969697) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:39:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2025-02-06 10:39:03,571 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 59 [2025-02-06 10:39:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:03,571 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2025-02-06 10:39:03,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2025-02-06 10:39:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 10:39:03,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:03,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:03,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 10:39:03,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:03,772 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:39:03,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1413277408, now seen corresponding path program 1 times [2025-02-06 10:39:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:03,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374104081] [2025-02-06 10:39:03,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:03,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:03,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:39:03,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:39:03,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:03,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:05,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:05,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374104081] [2025-02-06 10:39:05,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374104081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:05,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794055981] [2025-02-06 10:39:05,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:05,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:05,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:05,056 INFO L229 MonitoredProcess]: Starting monitored process 19 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:39:05,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:39:05,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:39:05,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:39:05,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:05,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:05,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-02-06 10:39:05,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:05,281 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:39:05,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:05,441 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:39:05,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:39:05,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:39:05,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:39:05,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-02-06 10:39:05,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:05,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:05,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:05,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 24 [2025-02-06 10:39:06,057 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:06,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 70 [2025-02-06 10:39:06,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 10:39:06,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:06,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2025-02-06 10:39:06,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2025-02-06 10:39:06,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-06 10:39:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:39:06,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:06,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2025-02-06 10:39:06,901 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3220 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3220) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_3219 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3219) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2025-02-06 10:39:06,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:06,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2025-02-06 10:39:06,914 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 11 [2025-02-06 10:39:07,293 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3213 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3213) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2025-02-06 10:39:07,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3213 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3212) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3213) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2025-02-06 10:39:07,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:07,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-06 10:39:07,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2025-02-06 10:39:07,409 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 6 treesize of output 4 [2025-02-06 10:39:07,411 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 6 treesize of output 4 [2025-02-06 10:39:07,413 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 6 treesize of output 4 [2025-02-06 10:39:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 10:39:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794055981] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:07,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 31] total 87 [2025-02-06 10:39:07,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358097572] [2025-02-06 10:39:07,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:07,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2025-02-06 10:39:07,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:07,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2025-02-06 10:39:07,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=6641, Unknown=68, NotChecked=498, Total=7482 [2025-02-06 10:39:07,801 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 87 states, 86 states have (on average 1.813953488372093) internal successors, (156), 79 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:39:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:09,875 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-02-06 10:39:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 10:39:09,875 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 1.813953488372093) internal successors, (156), 79 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 62 [2025-02-06 10:39:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:09,876 INFO L225 Difference]: With dead ends: 77 [2025-02-06 10:39:09,876 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:39:09,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2452 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=555, Invalid=11379, Unknown=68, NotChecked=654, Total=12656 [2025-02-06 10:39:09,877 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 58 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:09,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1906 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1950 Invalid, 0 Unknown, 149 Unchecked, 0.9s Time] [2025-02-06 10:39:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:39:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 10:39:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 73 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:39:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2025-02-06 10:39:09,880 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 62 [2025-02-06 10:39:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:09,880 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2025-02-06 10:39:09,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 1.813953488372093) internal successors, (156), 79 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:39:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2025-02-06 10:39:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 10:39:09,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:09,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:09,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 10:39:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:10,082 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:39:10,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1413191046, now seen corresponding path program 1 times [2025-02-06 10:39:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988263824] [2025-02-06 10:39:10,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:10,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:39:10,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:39:10,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:10,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 10:39:10,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:10,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988263824] [2025-02-06 10:39:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988263824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:10,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:39:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572161030] [2025-02-06 10:39:10,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:10,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:39:10,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:10,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:39:10,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:39:10,243 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:10,358 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2025-02-06 10:39:10,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:39:10,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2025-02-06 10:39:10,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:10,359 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:39:10,359 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:39:10,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:39:10,359 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:10,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 275 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:39:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:39:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 10:39:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 71 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:39:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-02-06 10:39:10,361 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2025-02-06 10:39:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:10,361 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-02-06 10:39:10,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-02-06 10:39:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 10:39:10,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:10,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:10,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 10:39:10,361 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:39:10,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1413191047, now seen corresponding path program 1 times [2025-02-06 10:39:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536684823] [2025-02-06 10:39:10,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:10,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:10,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:39:10,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:39:10,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:10,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:39:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:10,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536684823] [2025-02-06 10:39:10,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536684823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:10,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:10,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:39:10,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056668428] [2025-02-06 10:39:10,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:10,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:39:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:10,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:39:10,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:39:10,486 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:10,599 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-02-06 10:39:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:39:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2025-02-06 10:39:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:10,600 INFO L225 Difference]: With dead ends: 88 [2025-02-06 10:39:10,600 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 10:39:10,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:39:10,600 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:10,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 232 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:39:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 10:39:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2025-02-06 10:39:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.164179104477612) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:39:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2025-02-06 10:39:10,602 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 62 [2025-02-06 10:39:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:10,602 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2025-02-06 10:39:10,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2025-02-06 10:39:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 10:39:10,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:10,603 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:10,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 10:39:10,603 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:39:10,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash -859249186, now seen corresponding path program 1 times [2025-02-06 10:39:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865722862] [2025-02-06 10:39:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:10,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 10:39:10,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:39:10,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:10,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 10:39:10,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:10,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865722862] [2025-02-06 10:39:10,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865722862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:10,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:10,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:39:10,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087076134] [2025-02-06 10:39:10,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:10,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:39:10,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:10,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:39:10,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:39:10,707 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:10,784 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-02-06 10:39:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:39:10,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2025-02-06 10:39:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:10,785 INFO L225 Difference]: With dead ends: 78 [2025-02-06 10:39:10,785 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 10:39:10,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:39:10,789 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:10,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 329 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:39:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 10:39:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-06 10:39:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:39:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-02-06 10:39:10,791 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 63 [2025-02-06 10:39:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:10,791 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-02-06 10:39:10,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-02-06 10:39:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:39:10,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:10,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 10:39:10,791 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:39:10,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1105046845, now seen corresponding path program 1 times [2025-02-06 10:39:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527331086] [2025-02-06 10:39:10,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:10,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:39:10,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:39:10,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:10,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 10:39:10,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:10,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527331086] [2025-02-06 10:39:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527331086] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:10,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950172416] [2025-02-06 10:39:10,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:10,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:10,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:10,921 INFO L229 MonitoredProcess]: Starting monitored process 20 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:39:10,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:39:11,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:39:11,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:39:11,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:11,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:11,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-02-06 10:39:11,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:11,135 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:39:11,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:11,226 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:39:11,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:39:11,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:39:11,340 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:11,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:39:11,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:39:11,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:11,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:39:11,551 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:11,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:39:11,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:39:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:39:11,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:24,291 INFO L349 Elim1Store]: treesize reduction 5, result has 90.4 percent of original size [2025-02-06 10:39:24,291 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 56 treesize of output 55 [2025-02-06 10:39:24,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:24,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 66 [2025-02-06 10:39:24,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 207 [2025-02-06 10:39:24,366 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:24,368 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 197 treesize of output 189 [2025-02-06 10:39:24,373 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:24,374 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 137 treesize of output 125 [2025-02-06 10:39:24,376 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:24,377 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 115 treesize of output 109 [2025-02-06 10:39:24,381 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 38 treesize of output 36 [2025-02-06 10:39:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:39:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950172416] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:39:24,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:39:24,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23, 26] total 51 [2025-02-06 10:39:24,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906306265] [2025-02-06 10:39:24,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:24,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-06 10:39:24,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:24,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-06 10:39:24,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2469, Unknown=26, NotChecked=0, Total=2652 [2025-02-06 10:39:24,736 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 52 states, 51 states have (on average 2.9215686274509802) internal successors, (149), 46 states have internal predecessors, (149), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:39:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:25,917 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2025-02-06 10:39:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:39:25,917 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.9215686274509802) internal successors, (149), 46 states have internal predecessors, (149), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2025-02-06 10:39:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:25,918 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:39:25,918 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:39:25,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=225, Invalid=3531, Unknown=26, NotChecked=0, Total=3782 [2025-02-06 10:39:25,918 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 42 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:25,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 820 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 10:39:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:39:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2025-02-06 10:39:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:39:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2025-02-06 10:39:25,920 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 65 [2025-02-06 10:39:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:25,920 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2025-02-06 10:39:25,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.9215686274509802) internal successors, (149), 46 states have internal predecessors, (149), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:39:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2025-02-06 10:39:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:39:25,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:25,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:25,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-06 10:39:26,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:26,121 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:39:26,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1105046844, now seen corresponding path program 1 times [2025-02-06 10:39:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:26,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113085978] [2025-02-06 10:39:26,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:26,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:39:26,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:39:26,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:26,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:39:27,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:27,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113085978] [2025-02-06 10:39:27,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113085978] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:27,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454672048] [2025-02-06 10:39:27,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:27,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:27,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:27,076 INFO L229 MonitoredProcess]: Starting monitored process 21 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:39:27,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:39:27,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:39:27,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:39:27,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:27,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:27,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-02-06 10:39:27,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:27,331 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:39:27,334 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:39:27,555 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:39:27,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:39:27,564 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:27,564 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:39:27,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:39:27,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:39:27,692 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:27,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2025-02-06 10:39:27,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:39:27,787 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:27,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 10:39:27,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:39:27,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:39:27,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:39:27,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:27,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:39:27,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:27,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:39:28,151 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:28,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 10:39:28,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:39:28,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:39:28,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:39:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:39:28,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:39:30,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:30,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 98 [2025-02-06 10:39:30,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2025-02-06 10:39:30,153 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:30,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 125 [2025-02-06 10:39:30,162 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:30,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 89 [2025-02-06 10:39:30,173 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,173 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:30,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 81 [2025-02-06 10:39:30,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:30,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2025-02-06 10:39:30,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2025-02-06 10:39:30,205 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 92 treesize of output 84 [2025-02-06 10:39:30,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2025-02-06 10:39:30,231 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 38 treesize of output 36 [2025-02-06 10:39:30,249 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 10:39:30,255 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 10:39:30,273 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 10:39:30,282 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-06 10:39:30,289 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,290 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2025-02-06 10:39:30,299 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,299 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2025-02-06 10:39:30,305 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 21 treesize of output 17 [2025-02-06 10:39:30,314 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,315 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:30,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 222 [2025-02-06 10:39:30,321 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,321 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:39:30,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 178 [2025-02-06 10:39:30,327 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,328 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2025-02-06 10:39:30,331 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,332 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-02-06 10:39:30,335 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,336 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 42 treesize of output 34 [2025-02-06 10:39:30,344 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,344 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:39:30,345 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 16 treesize of output 12 [2025-02-06 10:39:30,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454672048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:30,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:39:30,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 52 [2025-02-06 10:39:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117670924] [2025-02-06 10:39:30,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:39:30,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-06 10:39:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:30,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-06 10:39:30,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4852, Unknown=27, NotChecked=0, Total=5112 [2025-02-06 10:39:30,582 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 53 states, 52 states have (on average 2.173076923076923) internal successors, (113), 47 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:39:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:31,726 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2025-02-06 10:39:31,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:39:31,726 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.173076923076923) internal successors, (113), 47 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 65 [2025-02-06 10:39:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:31,727 INFO L225 Difference]: With dead ends: 80 [2025-02-06 10:39:31,727 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 10:39:31,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=403, Invalid=7580, Unknown=27, NotChecked=0, Total=8010 [2025-02-06 10:39:31,728 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:31,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 873 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:39:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 10:39:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 10:39:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:39:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-02-06 10:39:31,729 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 65 [2025-02-06 10:39:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:31,729 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-02-06 10:39:31,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.173076923076923) internal successors, (113), 47 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:39:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-02-06 10:39:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:39:31,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:31,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:31,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-06 10:39:31,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-06 10:39:31,930 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:39:31,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash 103286838, now seen corresponding path program 1 times [2025-02-06 10:39:31,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992882200] [2025-02-06 10:39:31,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:31,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:39:31,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:39:31,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:31,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 10:39:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992882200] [2025-02-06 10:39:32,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992882200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:39:32,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:39:32,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:39:32,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929736658] [2025-02-06 10:39:32,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:39:32,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:39:32,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:39:32,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:39:32,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:39:32,069 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:39:32,241 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2025-02-06 10:39:32,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:39:32,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2025-02-06 10:39:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:39:32,242 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:39:32,242 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 10:39:32,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:39:32,243 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:39:32,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 275 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:39:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 10:39:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-06 10:39:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1) internal successors, (77), 75 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:39:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2025-02-06 10:39:32,244 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 66 [2025-02-06 10:39:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:39:32,244 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2025-02-06 10:39:32,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:39:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2025-02-06 10:39:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 10:39:32,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:39:32,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:39:32,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 10:39:32,249 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-02-06 10:39:32,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:39:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash 473757428, now seen corresponding path program 1 times [2025-02-06 10:39:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:39:32,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330954661] [2025-02-06 10:39:32,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:39:32,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 10:39:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:39:32,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:32,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:39:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:39:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330954661] [2025-02-06 10:39:33,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330954661] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:39:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337231248] [2025-02-06 10:39:33,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:39:33,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:39:33,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:39:33,138 INFO L229 MonitoredProcess]: Starting monitored process 22 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:39:33,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:39:33,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 10:39:33,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:39:33,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:39:33,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:39:33,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-02-06 10:39:33,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:39:33,375 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:39:33,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:39:33,480 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:39:33,480 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:39:33,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:39:33,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:39:33,668 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:33,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:39:33,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:39:33,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:39:33,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:39:33,968 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:39:33,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:39:34,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:39:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:39:34,106 INFO L312 TraceCheckSpWp]: Computing backward predicates...