./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c -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 6bc6b4117baccd9c0c047fce306a2f95fb55fa90595dfb64eaa429319b56a306 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:23:40,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:23:40,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:23:40,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:23:40,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:23:40,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:23:40,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:23:40,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:23:40,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:23:40,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:23:40,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:23:40,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:23:40,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:23:40,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:23:40,470 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:23:40,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:23:40,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:23:40,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:23:40,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:23:40,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:23:40,471 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:23:40,471 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:23:40,471 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:23:40,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:23:40,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:40,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:40,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:23:40,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:23:40,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:23:40,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:23:40,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:23:40,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:23:40,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:23:40,473 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 -> 6bc6b4117baccd9c0c047fce306a2f95fb55fa90595dfb64eaa429319b56a306 [2025-01-09 22:23:40,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:23:40,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:23:40,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:23:40,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:23:40,714 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:23:40,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2025-01-09 22:23:41,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1723be03/e850dd0e9c0b46fbaa71c85d51724236/FLAGa4f17e294 [2025-01-09 22:23:42,082 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:23:42,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2025-01-09 22:23:42,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1723be03/e850dd0e9c0b46fbaa71c85d51724236/FLAGa4f17e294 [2025-01-09 22:23:42,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1723be03/e850dd0e9c0b46fbaa71c85d51724236 [2025-01-09 22:23:42,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:23:42,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:23:42,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:23:42,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:23:42,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:23:42,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d51b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42, skipping insertion in model container [2025-01-09 22:23:42,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:23:42,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:23:42,573 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:23:42,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:23:42,597 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:23:42,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42 WrapperNode [2025-01-09 22:23:42,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:23:42,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:23:42,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:23:42,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:23:42,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,624 INFO L138 Inliner]: procedures = 13, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2025-01-09 22:23:42,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:23:42,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:23:42,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:23:42,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:23:42,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,649 INFO L175 MemorySlicer]: Split 48 memory accesses to 4 slices as follows [12, 12, 12, 12]. 25 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [10, 10, 10, 10]. The 4 writes are split as follows [1, 1, 1, 1]. [2025-01-09 22:23:42,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:23:42,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:23:42,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:23:42,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:23:42,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (1/1) ... [2025-01-09 22:23:42,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:42,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:42,702 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-01-09 22:23:42,705 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-01-09 22:23:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:23:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:23:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:23:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 22:23:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:23:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:23:42,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:23:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:23:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:23:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:23:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 22:23:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:23:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:23:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:23:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:23:42,803 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:23:42,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:23:43,043 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-01-09 22:23:43,047 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:23:43,054 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:23:43,054 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:23:43,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:43 BoogieIcfgContainer [2025-01-09 22:23:43,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:23:43,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:23:43,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:23:43,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:23:43,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:23:42" (1/3) ... [2025-01-09 22:23:43,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6f6fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:43, skipping insertion in model container [2025-01-09 22:23:43,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:42" (2/3) ... [2025-01-09 22:23:43,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6f6fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:43, skipping insertion in model container [2025-01-09 22:23:43,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:43" (3/3) ... [2025-01-09 22:23:43,064 INFO L128 eAbstractionObserver]: Analyzing ICFG getNumbers4-1.c [2025-01-09 22:23:43,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:23:43,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG getNumbers4-1.c that has 1 procedures, 44 locations, 1 initial locations, 5 loop locations, and 17 error locations. [2025-01-09 22:23:43,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:23:43,119 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;@57d7de52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:23:43,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-09 22:23:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:23:43,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:43,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:23:43,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:43,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:43,134 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-09 22:23:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:43,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827996017] [2025-01-09 22:23:43,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:43,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:23:43,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:23:43,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:43,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:43,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827996017] [2025-01-09 22:23:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827996017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:43,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:43,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 22:23:43,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699602567] [2025-01-09 22:23:43,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:43,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:43,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:43,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:43,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:43,416 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:43,464 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-01-09 22:23:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:23:43,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:43,473 INFO L225 Difference]: With dead ends: 43 [2025-01-09 22:23:43,474 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 22:23:43,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-09 22:23:43,477 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:43,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 27 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 22:23:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 22:23:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.8) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-01-09 22:23:43,508 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 4 [2025-01-09 22:23:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:43,508 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-01-09 22:23:43,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-01-09 22:23:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:23:43,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:43,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:23:43,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:23:43,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:43,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-09 22:23:43,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:43,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011858834] [2025-01-09 22:23:43,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:43,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:43,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:23:43,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:23:43,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:43,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011858834] [2025-01-09 22:23:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011858834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:43,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:43,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378471687] [2025-01-09 22:23:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:43,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:23:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:43,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:23:43,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:23:43,666 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:43,751 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-01-09 22:23:43,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:23:43,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:23:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:43,753 INFO L225 Difference]: With dead ends: 44 [2025-01-09 22:23:43,753 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 22:23:43,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-01-09 22:23:43,754 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:43,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 49 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 22:23:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-01-09 22:23:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-01-09 22:23:43,758 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 4 [2025-01-09 22:23:43,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:43,758 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-01-09 22:23:43,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-01-09 22:23:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:23:43,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:43,759 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 22:23:43,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:23:43,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:43,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1805828105, now seen corresponding path program 1 times [2025-01-09 22:23:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:43,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662811310] [2025-01-09 22:23:43,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:43,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:43,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:23:43,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:23:43,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:43,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:43,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662811310] [2025-01-09 22:23:43,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662811310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:43,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419571785] [2025-01-09 22:23:43,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:43,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:43,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:43,881 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-01-09 22:23:43,882 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-01-09 22:23:43,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:23:43,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:23:43,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:43,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:43,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:23:43,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:44,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:44,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419571785] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:44,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:44,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-01-09 22:23:44,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570932594] [2025-01-09 22:23:44,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:44,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:23:44,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:44,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:23:44,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:23:44,164 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:44,357 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-01-09 22:23:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:23:44,357 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:23:44,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:44,357 INFO L225 Difference]: With dead ends: 50 [2025-01-09 22:23:44,357 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 22:23:44,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:23:44,358 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 110 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:44,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 118 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 22:23:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 22:23:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.542857142857143) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-01-09 22:23:44,366 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 7 [2025-01-09 22:23:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:44,366 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-01-09 22:23:44,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-01-09 22:23:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:23:44,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:44,367 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:44,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:23:44,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:44,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:44,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1103292473, now seen corresponding path program 1 times [2025-01-09 22:23:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099781351] [2025-01-09 22:23:44,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:44,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:44,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:23:44,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:23:44,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:44,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:23:44,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:44,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099781351] [2025-01-09 22:23:44,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099781351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:44,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:44,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353852682] [2025-01-09 22:23:44,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:44,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:44,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:44,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:44,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:44,671 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:44,715 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-01-09 22:23:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:44,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:23:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:44,716 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:23:44,716 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:23:44,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:23:44,717 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:44,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 65 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:23:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:23:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-01-09 22:23:44,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 18 [2025-01-09 22:23:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:44,720 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-01-09 22:23:44,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-01-09 22:23:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:23:44,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:44,720 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:44,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:23:44,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:44,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1103292472, now seen corresponding path program 1 times [2025-01-09 22:23:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:44,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006248373] [2025-01-09 22:23:44,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:44,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:23:44,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:23:44,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:44,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:44,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:44,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006248373] [2025-01-09 22:23:44,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006248373] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:44,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123874636] [2025-01-09 22:23:44,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:44,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:44,792 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-01-09 22:23:44,793 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-01-09 22:23:44,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:23:44,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:23:44,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:44,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:44,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:23:44,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:44,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123874636] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:44,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:44,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:23:44,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202224791] [2025-01-09 22:23:44,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:44,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:23:44,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:44,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:23:44,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:44,923 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:44,960 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2025-01-09 22:23:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:23:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:23:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:44,961 INFO L225 Difference]: With dead ends: 67 [2025-01-09 22:23:44,961 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 22:23:44,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:44,962 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:44,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 188 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 22:23:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 22:23:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2025-01-09 22:23:44,965 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 18 [2025-01-09 22:23:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:44,965 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2025-01-09 22:23:44,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2025-01-09 22:23:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:23:44,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:44,966 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:44,972 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-01-09 22:23:45,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:45,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:45,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1855650008, now seen corresponding path program 2 times [2025-01-09 22:23:45,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:45,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551827690] [2025-01-09 22:23:45,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:45,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:45,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:23:45,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-09 22:23:45,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:45,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:45,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:45,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551827690] [2025-01-09 22:23:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551827690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:45,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:23:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603050146] [2025-01-09 22:23:45,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:45,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:45,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:45,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:45,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:45,284 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:45,356 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2025-01-09 22:23:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:23:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:45,357 INFO L225 Difference]: With dead ends: 72 [2025-01-09 22:23:45,357 INFO L226 Difference]: Without dead ends: 72 [2025-01-09 22:23:45,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:23:45,357 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:45,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 66 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-09 22:23:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-01-09 22:23:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2025-01-09 22:23:45,360 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 36 [2025-01-09 22:23:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:45,360 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2025-01-09 22:23:45,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2025-01-09 22:23:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:23:45,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:45,361 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:45,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:23:45,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:45,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1690575439, now seen corresponding path program 1 times [2025-01-09 22:23:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492992942] [2025-01-09 22:23:45,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:45,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:45,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:45,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:45,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:45,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:45,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492992942] [2025-01-09 22:23:45,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492992942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:45,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:45,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 22:23:45,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529972286] [2025-01-09 22:23:45,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:45,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:45,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:45,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:45,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:45,455 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:45,471 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2025-01-09 22:23:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:45,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:23:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:45,472 INFO L225 Difference]: With dead ends: 68 [2025-01-09 22:23:45,472 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 22:23:45,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-09 22:23:45,473 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:45,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 25 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 22:23:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-09 22:23:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.309090909090909) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-01-09 22:23:45,475 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 37 [2025-01-09 22:23:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:45,475 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-01-09 22:23:45,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-01-09 22:23:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:23:45,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:45,481 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:45,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:23:45,481 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:45,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1690575438, now seen corresponding path program 1 times [2025-01-09 22:23:45,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:45,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012590917] [2025-01-09 22:23:45,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:45,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:45,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:45,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:45,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:45,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012590917] [2025-01-09 22:23:45,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012590917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:45,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:45,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:45,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921820524] [2025-01-09 22:23:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:45,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:23:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:45,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:23:45,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:23:45,657 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:45,695 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2025-01-09 22:23:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:23:45,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:23:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:45,697 INFO L225 Difference]: With dead ends: 70 [2025-01-09 22:23:45,697 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 22:23:45,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-01-09 22:23:45,697 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:45,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 44 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 22:23:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-01-09 22:23:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2025-01-09 22:23:45,701 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 37 [2025-01-09 22:23:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:45,702 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2025-01-09 22:23:45,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2025-01-09 22:23:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:23:45,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:45,702 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:45,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:23:45,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1146395540, now seen corresponding path program 1 times [2025-01-09 22:23:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551753742] [2025-01-09 22:23:45,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:45,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:23:45,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:23:45,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:45,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:45,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551753742] [2025-01-09 22:23:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551753742] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709538523] [2025-01-09 22:23:45,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:45,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:45,932 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-01-09 22:23:45,934 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-01-09 22:23:45,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:23:46,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:23:46,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:46,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:46,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:23:46,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:46,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709538523] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:46,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:46,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-01-09 22:23:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838915798] [2025-01-09 22:23:46,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:46,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:23:46,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:46,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:23:46,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:23:46,443 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:46,636 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2025-01-09 22:23:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:23:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-01-09 22:23:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:46,638 INFO L225 Difference]: With dead ends: 80 [2025-01-09 22:23:46,638 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 22:23:46,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:23:46,638 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 174 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:46,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 158 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:46,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 22:23:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 22:23:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-01-09 22:23:46,641 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 40 [2025-01-09 22:23:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:46,642 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-01-09 22:23:46,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-01-09 22:23:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:23:46,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:46,642 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:46,648 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-01-09 22:23:46,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:46,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:46,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1178523410, now seen corresponding path program 1 times [2025-01-09 22:23:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:46,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86760638] [2025-01-09 22:23:46,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:46,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:23:46,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:23:46,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:46,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:46,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:46,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86760638] [2025-01-09 22:23:46,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86760638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:46,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616108395] [2025-01-09 22:23:46,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:46,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:46,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:46,980 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-01-09 22:23:46,982 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-01-09 22:23:47,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:23:47,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:23:47,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:47,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:47,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:23:47,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:47,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616108395] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:47,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:47,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-09 22:23:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360652923] [2025-01-09 22:23:47,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:47,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:23:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:47,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:23:47,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:23:47,447 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:47,583 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2025-01-09 22:23:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:23:47,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-09 22:23:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:47,584 INFO L225 Difference]: With dead ends: 81 [2025-01-09 22:23:47,584 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 22:23:47,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:23:47,585 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 96 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:47,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 64 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 22:23:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 22:23:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.25) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-01-09 22:23:47,590 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 41 [2025-01-09 22:23:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:47,591 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-01-09 22:23:47,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-01-09 22:23:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:23:47,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:47,593 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 22:23:47,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:47,799 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,SelfDestructingSolverStorable9 [2025-01-09 22:23:47,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 493940792, now seen corresponding path program 2 times [2025-01-09 22:23:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:47,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429864932] [2025-01-09 22:23:47,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:47,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-01-09 22:23:47,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:23:47,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:23:47,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429864932] [2025-01-09 22:23:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429864932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762771095] [2025-01-09 22:23:48,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:48,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:48,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:48,100 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-01-09 22:23:48,101 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-01-09 22:23:48,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-01-09 22:23:48,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:23:48,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:23:48,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:48,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 22:23:48,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:48,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762771095] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:48,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:48,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-01-09 22:23:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720193762] [2025-01-09 22:23:48,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:48,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:23:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:48,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:23:48,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:23:48,756 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:49,129 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2025-01-09 22:23:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:23:49,130 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-01-09 22:23:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:49,131 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:23:49,131 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 22:23:49,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:23:49,132 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 99 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:49,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 157 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 22:23:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 22:23:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2025-01-09 22:23:49,136 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 52 [2025-01-09 22:23:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:49,136 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2025-01-09 22:23:49,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2025-01-09 22:23:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:23:49,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:49,137 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 22:23:49,145 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-01-09 22:23:49,341 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,SelfDestructingSolverStorable10 [2025-01-09 22:23:49,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:49,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1867704670, now seen corresponding path program 2 times [2025-01-09 22:23:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130502747] [2025-01-09 22:23:49,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:49,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 22:23:49,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 53 statements. [2025-01-09 22:23:49,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:49,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 22:23:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130502747] [2025-01-09 22:23:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130502747] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916290165] [2025-01-09 22:23:49,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:49,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:49,447 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-01-09 22:23:49,449 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-01-09 22:23:49,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 22:23:49,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 53 statements. [2025-01-09 22:23:49,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:49,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:49,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 22:23:49,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 22:23:49,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 22:23:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916290165] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:50,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:50,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-09 22:23:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040548476] [2025-01-09 22:23:50,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:50,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:23:50,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:50,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:23:50,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:23:50,331 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:50,481 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2025-01-09 22:23:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:23:50,482 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 22:23:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:50,482 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:23:50,482 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:23:50,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:23:50,483 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 88 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:50,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 176 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:23:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 22:23:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 102 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2025-01-09 22:23:50,489 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 53 [2025-01-09 22:23:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:50,489 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2025-01-09 22:23:50,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2025-01-09 22:23:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:23:50,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:50,490 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:50,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:50,690 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,SelfDestructingSolverStorable11 [2025-01-09 22:23:50,690 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:50,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1887768573, now seen corresponding path program 1 times [2025-01-09 22:23:50,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:50,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098493398] [2025-01-09 22:23:50,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:50,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:23:50,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:23:50,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:50,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-09 22:23:50,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098493398] [2025-01-09 22:23:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098493398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:50,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:50,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672010565] [2025-01-09 22:23:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:50,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:50,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:50,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:50,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:50,773 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:50,804 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2025-01-09 22:23:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:50,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 22:23:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:50,805 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:23:50,805 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:23:50,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:23:50,805 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 41 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:50,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 62 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:23:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 22:23:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2025-01-09 22:23:50,808 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 58 [2025-01-09 22:23:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:50,808 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2025-01-09 22:23:50,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2025-01-09 22:23:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:23:50,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:50,808 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:23:50,809 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:50,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1887768574, now seen corresponding path program 1 times [2025-01-09 22:23:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:50,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620341728] [2025-01-09 22:23:50,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:50,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:23:50,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:23:50,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:50,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:50,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:50,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620341728] [2025-01-09 22:23:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620341728] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:50,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817032257] [2025-01-09 22:23:50,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:50,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:50,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:50,900 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-01-09 22:23:50,902 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-01-09 22:23:50,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:23:50,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:23:50,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:50,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:50,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:23:50,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:51,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:51,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817032257] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:51,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:51,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-01-09 22:23:51,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577902291] [2025-01-09 22:23:51,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:51,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:23:51,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:51,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:23:51,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:51,071 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:51,114 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2025-01-09 22:23:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:23:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 22:23:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:51,115 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:23:51,115 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:23:51,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:51,115 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:51,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 128 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:23:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 22:23:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.164835164835165) internal successors, (106), 101 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2025-01-09 22:23:51,118 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 58 [2025-01-09 22:23:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:51,118 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2025-01-09 22:23:51,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2025-01-09 22:23:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 22:23:51,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:51,118 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-01-09 22:23:51,126 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-01-09 22:23:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:51,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:51,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1740181968, now seen corresponding path program 3 times [2025-01-09 22:23:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707041639] [2025-01-09 22:23:51,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:23:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:51,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 11 equivalence classes. [2025-01-09 22:23:51,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 76 statements. [2025-01-09 22:23:51,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:23:51,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-01-09 22:23:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707041639] [2025-01-09 22:23:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707041639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:23:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514665796] [2025-01-09 22:23:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:51,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:23:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:51,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:23:51,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:23:51,429 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:51,499 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2025-01-09 22:23:51,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:23:51,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 22:23:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:51,499 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:23:51,500 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:23:51,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:51,501 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:51,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 76 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:23:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-01-09 22:23:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 99 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2025-01-09 22:23:51,503 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 76 [2025-01-09 22:23:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:51,503 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2025-01-09 22:23:51,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2025-01-09 22:23:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 22:23:51,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:51,506 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:51,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:23:51,506 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:51,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:51,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1572869970, now seen corresponding path program 2 times [2025-01-09 22:23:51,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:51,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769264218] [2025-01-09 22:23:51,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:51,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:51,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-09 22:23:51,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 78 statements. [2025-01-09 22:23:51,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:51,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:51,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:51,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769264218] [2025-01-09 22:23:51,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769264218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:51,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:51,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:23:51,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736755940] [2025-01-09 22:23:51,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:51,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:51,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:51,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:51,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:51,570 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:51,620 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2025-01-09 22:23:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:51,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 22:23:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:51,621 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:23:51,621 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 22:23:51,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:23:51,622 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:51,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 22:23:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2025-01-09 22:23:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 101 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2025-01-09 22:23:51,624 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 78 [2025-01-09 22:23:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:51,624 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2025-01-09 22:23:51,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2025-01-09 22:23:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 22:23:51,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:51,624 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:51,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:23:51,628 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:51,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1514328790, now seen corresponding path program 1 times [2025-01-09 22:23:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:51,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900281890] [2025-01-09 22:23:51,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:51,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 22:23:51,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 22:23:51,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:51,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:51,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900281890] [2025-01-09 22:23:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900281890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:51,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 22:23:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827960947] [2025-01-09 22:23:51,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:51,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:51,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:51,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:51,709 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:51,724 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2025-01-09 22:23:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:51,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 22:23:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:51,725 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:23:51,725 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:23:51,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-09 22:23:51,725 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:51,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 23 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:23:51,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 22:23:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 92 states have (on average 1.141304347826087) internal successors, (105), 100 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2025-01-09 22:23:51,727 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 79 [2025-01-09 22:23:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:51,728 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2025-01-09 22:23:51,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2025-01-09 22:23:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 22:23:51,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:51,730 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:51,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:23:51,730 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1514328791, now seen corresponding path program 1 times [2025-01-09 22:23:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354491833] [2025-01-09 22:23:51,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:51,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 22:23:51,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 22:23:51,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:51,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354491833] [2025-01-09 22:23:51,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354491833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:51,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:51,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:51,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627479388] [2025-01-09 22:23:51,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:51,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:23:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:51,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:23:51,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:23:51,873 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:51,901 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2025-01-09 22:23:51,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:23:51,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 22:23:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:51,902 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:23:51,902 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:23:51,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-01-09 22:23:51,903 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:51,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:23:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-01-09 22:23:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 93 states have (on average 1.1397849462365592) internal successors, (106), 101 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2025-01-09 22:23:51,906 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 79 [2025-01-09 22:23:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:51,906 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2025-01-09 22:23:51,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2025-01-09 22:23:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 22:23:51,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:51,908 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:51,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:23:51,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:51,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:51,908 INFO L85 PathProgramCache]: Analyzing trace with hash -967484586, now seen corresponding path program 1 times [2025-01-09 22:23:51,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:51,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093822165] [2025-01-09 22:23:51,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:51,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 22:23:51,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 22:23:51,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:51,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:52,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093822165] [2025-01-09 22:23:52,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093822165] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289021396] [2025-01-09 22:23:52,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:52,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:52,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:52,103 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-01-09 22:23:52,109 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-01-09 22:23:52,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 22:23:52,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 22:23:52,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:52,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:52,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:23:52,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:52,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:52,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289021396] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:52,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-09 22:23:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982326592] [2025-01-09 22:23:52,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:52,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:23:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:52,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:23:52,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:23:52,770 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:52,901 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2025-01-09 22:23:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:23:52,902 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 22:23:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:52,902 INFO L225 Difference]: With dead ends: 113 [2025-01-09 22:23:52,902 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 22:23:52,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:23:52,903 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 53 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:52,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 123 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 22:23:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 22:23:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 112 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-01-09 22:23:52,905 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 82 [2025-01-09 22:23:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:52,905 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-01-09 22:23:52,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-01-09 22:23:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 22:23:52,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:52,905 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:52,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:23:53,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:53,110 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:53,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash 72748883, now seen corresponding path program 1 times [2025-01-09 22:23:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:53,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263841526] [2025-01-09 22:23:53,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:53,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:53,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 22:23:53,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 22:23:53,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:53,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:53,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263841526] [2025-01-09 22:23:53,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263841526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815617873] [2025-01-09 22:23:53,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:53,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:53,252 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-01-09 22:23:53,253 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-01-09 22:23:53,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 22:23:53,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 22:23:53,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:53,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:53,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:23:53,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:53,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815617873] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:53,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:53,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-09 22:23:53,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271617634] [2025-01-09 22:23:53,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:53,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:23:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:53,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:23:53,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:23:53,869 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:53,957 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2025-01-09 22:23:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:23:53,958 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-09 22:23:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:53,958 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:23:53,958 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:23:53,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:23:53,959 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:53,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 58 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:23:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 22:23:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 113 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2025-01-09 22:23:53,961 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 83 [2025-01-09 22:23:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:53,961 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2025-01-09 22:23:53,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2025-01-09 22:23:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 22:23:53,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:53,961 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:53,968 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-01-09 22:23:54,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:54,163 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:54,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash -706782366, now seen corresponding path program 2 times [2025-01-09 22:23:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:54,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424951375] [2025-01-09 22:23:54,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:54,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-01-09 22:23:54,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 22:23:54,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:23:54,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:54,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:54,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424951375] [2025-01-09 22:23:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424951375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:54,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538477893] [2025-01-09 22:23:54,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:54,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:54,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:54,458 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-01-09 22:23:54,460 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-01-09 22:23:54,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-01-09 22:23:54,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 22:23:54,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:23:54,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:54,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 22:23:54,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:55,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:23:55,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538477893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:55,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:23:55,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 16 [2025-01-09 22:23:55,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182072397] [2025-01-09 22:23:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:55,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:23:55,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:55,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:23:55,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:23:55,006 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:55,144 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2025-01-09 22:23:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:23:55,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 22:23:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:55,145 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:23:55,145 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:23:55,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:23:55,146 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 72 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:55,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 72 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:23:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-01-09 22:23:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.1142857142857143) internal successors, (117), 112 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2025-01-09 22:23:55,148 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 94 [2025-01-09 22:23:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:55,148 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2025-01-09 22:23:55,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2025-01-09 22:23:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 22:23:55,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:55,149 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:55,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:23:55,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:55,349 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:55,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -435416889, now seen corresponding path program 2 times [2025-01-09 22:23:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935222489] [2025-01-09 22:23:55,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:55,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-09 22:23:55,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 95 statements. [2025-01-09 22:23:55,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:55,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-01-09 22:23:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935222489] [2025-01-09 22:23:55,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935222489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228464023] [2025-01-09 22:23:55,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:55,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:55,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:55,439 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-01-09 22:23:55,440 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-01-09 22:23:55,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-09 22:23:55,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 95 statements. [2025-01-09 22:23:55,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:55,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:55,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 22:23:55,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-01-09 22:23:55,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-01-09 22:23:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228464023] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:56,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:56,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-09 22:23:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384940500] [2025-01-09 22:23:56,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:56,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:23:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:56,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:23:56,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:23:56,607 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 17 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:56,714 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2025-01-09 22:23:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:23:56,715 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 22:23:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:56,715 INFO L225 Difference]: With dead ends: 112 [2025-01-09 22:23:56,715 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 22:23:56,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:23:56,717 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:56,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 125 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 22:23:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-01-09 22:23:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 103 states have (on average 1.1067961165048543) internal successors, (114), 109 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-01-09 22:23:56,720 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 95 [2025-01-09 22:23:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:56,720 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-01-09 22:23:56,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-01-09 22:23:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 22:23:56,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:56,721 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:56,740 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-01-09 22:23:56,921 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,SelfDestructingSolverStorable21 [2025-01-09 22:23:56,922 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:56,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash -612743613, now seen corresponding path program 1 times [2025-01-09 22:23:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:56,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111526897] [2025-01-09 22:23:56,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:56,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 22:23:56,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 22:23:56,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:56,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-01-09 22:23:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111526897] [2025-01-09 22:23:56,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111526897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:56,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:56,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:56,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701289264] [2025-01-09 22:23:56,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:56,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:56,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:56,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:56,990 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:57,023 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2025-01-09 22:23:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:57,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 22:23:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:57,024 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:23:57,024 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 22:23:57,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:23:57,025 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:57,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 22:23:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 22:23:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 108 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2025-01-09 22:23:57,029 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 96 [2025-01-09 22:23:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:57,029 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2025-01-09 22:23:57,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2025-01-09 22:23:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 22:23:57,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:57,030 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:57,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:23:57,030 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:57,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash -612743612, now seen corresponding path program 1 times [2025-01-09 22:23:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:57,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920451862] [2025-01-09 22:23:57,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:57,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 22:23:57,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 22:23:57,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:57,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:57,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:57,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920451862] [2025-01-09 22:23:57,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920451862] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:57,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114864186] [2025-01-09 22:23:57,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:57,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:57,120 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-01-09 22:23:57,121 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-01-09 22:23:57,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 22:23:57,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 22:23:57,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:57,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:57,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:23:57,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:57,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-09 22:23:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114864186] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:57,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:57,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:23:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760119879] [2025-01-09 22:23:57,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:57,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:23:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:57,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:23:57,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:57,303 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:57,344 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2025-01-09 22:23:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:23:57,345 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 22:23:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:57,345 INFO L225 Difference]: With dead ends: 133 [2025-01-09 22:23:57,345 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 22:23:57,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:57,346 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:57,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 112 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 22:23:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-09 22:23:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 127 states have (on average 1.078740157480315) internal successors, (137), 132 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2025-01-09 22:23:57,348 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 96 [2025-01-09 22:23:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:57,348 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2025-01-09 22:23:57,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2025-01-09 22:23:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 22:23:57,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:57,349 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:57,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:23:57,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:57,549 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:57,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:57,550 INFO L85 PathProgramCache]: Analyzing trace with hash 782502492, now seen corresponding path program 2 times [2025-01-09 22:23:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151848830] [2025-01-09 22:23:57,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:57,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-01-09 22:23:57,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 120 statements. [2025-01-09 22:23:57,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:57,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:23:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151848830] [2025-01-09 22:23:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151848830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:57,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:57,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:23:57,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430974057] [2025-01-09 22:23:57,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:57,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:57,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:57,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:57,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:57,610 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:57,654 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2025-01-09 22:23:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:57,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 22:23:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:57,655 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:23:57,655 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:23:57,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:23:57,656 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:57,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 54 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:23:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-01-09 22:23:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 129 states have (on average 1.0775193798449612) internal successors, (139), 134 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2025-01-09 22:23:57,662 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 120 [2025-01-09 22:23:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:57,662 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2025-01-09 22:23:57,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2025-01-09 22:23:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 22:23:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:57,663 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:57,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:23:57,663 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1512226533, now seen corresponding path program 1 times [2025-01-09 22:23:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897945829] [2025-01-09 22:23:57,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:57,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 22:23:57,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 22:23:57,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:57,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:23:57,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:57,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897945829] [2025-01-09 22:23:57,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897945829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:57,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:57,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 22:23:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262521619] [2025-01-09 22:23:57,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:57,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:57,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:57,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:57,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:57,769 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:57,786 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2025-01-09 22:23:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-01-09 22:23:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:57,787 INFO L225 Difference]: With dead ends: 134 [2025-01-09 22:23:57,787 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 22:23:57,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-09 22:23:57,788 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:57,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 21 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 22:23:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-01-09 22:23:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.069767441860465) internal successors, (138), 133 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2025-01-09 22:23:57,791 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 121 [2025-01-09 22:23:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:57,792 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2025-01-09 22:23:57,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2025-01-09 22:23:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 22:23:57,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:57,792 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:57,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:23:57,793 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:57,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:57,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1512226532, now seen corresponding path program 1 times [2025-01-09 22:23:57,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:57,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979107971] [2025-01-09 22:23:57,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:57,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 22:23:57,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 22:23:57,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:57,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:23:57,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979107971] [2025-01-09 22:23:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979107971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:57,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:57,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090818957] [2025-01-09 22:23:57,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:57,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:23:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:57,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:23:57,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:23:57,944 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:57,968 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2025-01-09 22:23:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:23:57,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-01-09 22:23:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:57,969 INFO L225 Difference]: With dead ends: 136 [2025-01-09 22:23:57,969 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 22:23:57,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-01-09 22:23:57,969 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:57,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 22:23:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2025-01-09 22:23:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0692307692307692) internal successors, (139), 134 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2025-01-09 22:23:57,976 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 121 [2025-01-09 22:23:57,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:57,976 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2025-01-09 22:23:57,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2025-01-09 22:23:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 22:23:57,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:57,980 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:57,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:23:57,981 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:57,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash -828652256, now seen corresponding path program 1 times [2025-01-09 22:23:57,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:57,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275014832] [2025-01-09 22:23:57,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:57,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:57,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 22:23:58,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 22:23:58,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:58,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:23:58,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:58,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275014832] [2025-01-09 22:23:58,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275014832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:58,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369411653] [2025-01-09 22:23:58,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:58,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:58,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:58,272 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-01-09 22:23:58,273 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-01-09 22:23:58,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 22:23:58,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 22:23:58,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:58,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:58,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:23:58,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:23:58,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:23:59,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369411653] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:59,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:59,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-09 22:23:59,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303342563] [2025-01-09 22:23:59,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:59,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:23:59,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:59,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:23:59,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:23:59,111 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:59,234 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2025-01-09 22:23:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:23:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 22:23:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:59,235 INFO L225 Difference]: With dead ends: 146 [2025-01-09 22:23:59,235 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 22:23:59,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:23:59,235 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 78 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:59,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 111 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 22:23:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-01-09 22:23:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0921985815602837) internal successors, (154), 145 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2025-01-09 22:23:59,239 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 124 [2025-01-09 22:23:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:59,239 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2025-01-09 22:23:59,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2025-01-09 22:23:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 22:23:59,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:59,240 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:59,247 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-01-09 22:23:59,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:23:59,441 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:23:59,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:59,441 INFO L85 PathProgramCache]: Analyzing trace with hash 81583832, now seen corresponding path program 1 times [2025-01-09 22:23:59,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:59,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089307411] [2025-01-09 22:23:59,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:59,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:59,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 22:23:59,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 22:23:59,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:23:59,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:59,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089307411] [2025-01-09 22:23:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089307411] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:59,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111520977] [2025-01-09 22:23:59,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:59,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:59,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:59,615 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-01-09 22:23:59,617 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-01-09 22:23:59,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 22:23:59,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 22:23:59,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:59,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:59,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:23:59,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:24:00,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:24:00,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111520977] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:00,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:00,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-09 22:24:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97670960] [2025-01-09 22:24:00,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:00,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:24:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:00,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:24:00,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:24:00,351 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:00,451 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2025-01-09 22:24:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:24:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-01-09 22:24:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:00,452 INFO L225 Difference]: With dead ends: 147 [2025-01-09 22:24:00,452 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 22:24:00,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:24:00,453 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:00,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 100 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 22:24:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-01-09 22:24:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.0633802816901408) internal successors, (151), 146 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2025-01-09 22:24:00,459 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 125 [2025-01-09 22:24:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:00,460 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2025-01-09 22:24:00,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2025-01-09 22:24:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 22:24:00,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:00,461 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:00,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 22:24:00,662 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,SelfDestructingSolverStorable28 [2025-01-09 22:24:00,663 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:24:00,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash 225765740, now seen corresponding path program 2 times [2025-01-09 22:24:00,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:00,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305687466] [2025-01-09 22:24:00,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:00,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-01-09 22:24:00,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 22:24:00,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:00,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:24:00,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305687466] [2025-01-09 22:24:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305687466] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186767019] [2025-01-09 22:24:00,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:00,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:00,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:00,943 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-01-09 22:24:00,944 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-01-09 22:24:01,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-01-09 22:24:01,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 22:24:01,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:01,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:01,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 22:24:01,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:24:01,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 22:24:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186767019] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:01,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:01,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2025-01-09 22:24:01,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147785777] [2025-01-09 22:24:01,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:01,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:24:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:01,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:24:01,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:24:01,889 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:02,212 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2025-01-09 22:24:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:24:02,212 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-01-09 22:24:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:02,213 INFO L225 Difference]: With dead ends: 168 [2025-01-09 22:24:02,213 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 22:24:02,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 22:24:02,214 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 88 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:02,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 200 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 22:24:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-01-09 22:24:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 164 states have (on average 1.079268292682927) internal successors, (177), 167 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2025-01-09 22:24:02,217 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 136 [2025-01-09 22:24:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:02,217 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2025-01-09 22:24:02,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2025-01-09 22:24:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 22:24:02,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:02,218 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:02,224 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-01-09 22:24:02,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:02,418 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:24:02,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1591196660, now seen corresponding path program 2 times [2025-01-09 22:24:02,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:02,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063323977] [2025-01-09 22:24:02,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:02,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:02,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-01-09 22:24:02,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 137 statements. [2025-01-09 22:24:02,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:24:02,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-09 22:24:02,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:02,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063323977] [2025-01-09 22:24:02,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063323977] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:02,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770718914] [2025-01-09 22:24:02,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:02,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:02,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:02,502 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-01-09 22:24:02,504 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-01-09 22:24:02,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-01-09 22:24:02,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 137 statements. [2025-01-09 22:24:02,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:24:02,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:02,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 22:24:02,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-09 22:24:03,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-09 22:24:04,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770718914] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:04,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:04,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-09 22:24:04,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735546714] [2025-01-09 22:24:04,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:04,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:24:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:04,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:24:04,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:24:04,073 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand has 17 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:04,172 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2025-01-09 22:24:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:24:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2025-01-09 22:24:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:04,173 INFO L225 Difference]: With dead ends: 167 [2025-01-09 22:24:04,173 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 22:24:04,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:24:04,174 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 46 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:04,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 141 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 22:24:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-01-09 22:24:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 164 states have (on average 1.0426829268292683) internal successors, (171), 166 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2025-01-09 22:24:04,176 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 137 [2025-01-09 22:24:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:04,176 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2025-01-09 22:24:04,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2025-01-09 22:24:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 22:24:04,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:04,177 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:04,183 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-01-09 22:24:04,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:04,378 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:24:04,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash 924272901, now seen corresponding path program 1 times [2025-01-09 22:24:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081445631] [2025-01-09 22:24:04,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:04,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 22:24:04,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 22:24:04,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:04,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:24:04,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:04,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081445631] [2025-01-09 22:24:04,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081445631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:04,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:04,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374731509] [2025-01-09 22:24:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:04,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:04,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:04,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:04,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:04,443 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:04,451 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2025-01-09 22:24:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:04,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-01-09 22:24:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:04,452 INFO L225 Difference]: With dead ends: 171 [2025-01-09 22:24:04,452 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 22:24:04,452 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-01-09 22:24:04,453 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:04,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 22:24:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2025-01-09 22:24:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 165 states have (on average 1.0424242424242425) internal successors, (172), 167 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 172 transitions. [2025-01-09 22:24:04,458 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 172 transitions. Word has length 162 [2025-01-09 22:24:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:04,458 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 172 transitions. [2025-01-09 22:24:04,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2025-01-09 22:24:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 22:24:04,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:04,459 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:04,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 22:24:04,459 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:24:04,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash 924272709, now seen corresponding path program 1 times [2025-01-09 22:24:04,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:04,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452054281] [2025-01-09 22:24:04,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:04,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:04,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 22:24:04,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 22:24:04,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:04,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-01-09 22:24:04,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:04,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452054281] [2025-01-09 22:24:04,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452054281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:04,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:04,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:24:04,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104652029] [2025-01-09 22:24:04,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:04,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:04,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:04,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:04,557 INFO L87 Difference]: Start difference. First operand 168 states and 172 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:04,583 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2025-01-09 22:24:04,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:04,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-01-09 22:24:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:04,584 INFO L225 Difference]: With dead ends: 167 [2025-01-09 22:24:04,584 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 22:24:04,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:24:04,585 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:04,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 49 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 22:24:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-01-09 22:24:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.0363636363636364) internal successors, (171), 166 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2025-01-09 22:24:04,588 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 162 [2025-01-09 22:24:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:04,588 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2025-01-09 22:24:04,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2025-01-09 22:24:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 22:24:04,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:04,589 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:04,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 22:24:04,589 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:24:04,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:04,589 INFO L85 PathProgramCache]: Analyzing trace with hash 924272710, now seen corresponding path program 1 times [2025-01-09 22:24:04,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:04,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160884109] [2025-01-09 22:24:04,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:04,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:04,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 22:24:04,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 22:24:04,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:04,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:24:04,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:04,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160884109] [2025-01-09 22:24:04,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160884109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:04,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:04,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:04,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911324695] [2025-01-09 22:24:04,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:04,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:04,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:04,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:04,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:04,789 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:04,825 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2025-01-09 22:24:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:04,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-01-09 22:24:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:04,826 INFO L225 Difference]: With dead ends: 169 [2025-01-09 22:24:04,826 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 22:24:04,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:24:04,826 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:04,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 49 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 22:24:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2025-01-09 22:24:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 1.036144578313253) internal successors, (172), 167 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 172 transitions. [2025-01-09 22:24:04,828 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 172 transitions. Word has length 162 [2025-01-09 22:24:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:04,828 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 172 transitions. [2025-01-09 22:24:04,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2025-01-09 22:24:04,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 22:24:04,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:04,829 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:04,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 22:24:04,829 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:24:04,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash -27024031, now seen corresponding path program 1 times [2025-01-09 22:24:04,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:04,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006054483] [2025-01-09 22:24:04,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:04,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 22:24:04,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 22:24:04,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:04,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:24:04,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:04,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006054483] [2025-01-09 22:24:04,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006054483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:04,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255812861] [2025-01-09 22:24:04,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:04,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:04,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:04,915 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-01-09 22:24:04,916 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-01-09 22:24:05,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 22:24:05,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 22:24:05,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:05,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:05,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 22:24:05,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-01-09 22:24:05,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255812861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:05,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:24:05,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-09 22:24:05,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130589316] [2025-01-09 22:24:05,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:05,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:05,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:05,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:05,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:05,196 INFO L87 Difference]: Start difference. First operand 168 states and 172 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:05,208 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2025-01-09 22:24:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:05,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-01-09 22:24:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:05,208 INFO L225 Difference]: With dead ends: 167 [2025-01-09 22:24:05,208 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 22:24:05,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:05,209 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 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-01-09 22:24:05,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 22:24:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-01-09 22:24:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2025-01-09 22:24:05,211 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 165 [2025-01-09 22:24:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:05,211 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2025-01-09 22:24:05,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2025-01-09 22:24:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 22:24:05,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:05,212 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:05,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:05,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:05,413 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:24:05,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash -27024222, now seen corresponding path program 1 times [2025-01-09 22:24:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387557296] [2025-01-09 22:24:05,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:05,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 22:24:05,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 22:24:05,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:05,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:24:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387557296] [2025-01-09 22:24:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387557296] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002365943] [2025-01-09 22:24:05,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:05,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:05,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:05,618 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-01-09 22:24:05,632 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-01-09 22:24:05,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 22:24:05,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 22:24:05,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:05,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:05,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:24:05,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:24:06,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:24:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002365943] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:06,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-09 22:24:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490278926] [2025-01-09 22:24:06,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:06,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:24:06,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:06,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:24:06,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:24:06,641 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand has 14 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:06,726 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2025-01-09 22:24:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:24:06,727 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-01-09 22:24:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:06,727 INFO L225 Difference]: With dead ends: 175 [2025-01-09 22:24:06,727 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 22:24:06,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:24:06,728 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:06,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 22:24:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-01-09 22:24:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.028735632183908) internal successors, (179), 174 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2025-01-09 22:24:06,730 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 165 [2025-01-09 22:24:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:06,730 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2025-01-09 22:24:06,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2025-01-09 22:24:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 22:24:06,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:06,731 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:06,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:06,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-09 22:24:06,931 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-01-09 22:24:06,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1227361606, now seen corresponding path program 2 times [2025-01-09 22:24:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:06,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121477435] [2025-01-09 22:24:06,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:06,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:06,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-01-09 22:24:06,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 22:24:06,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:06,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:24:07,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:07,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121477435] [2025-01-09 22:24:07,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121477435] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:07,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279364827] [2025-01-09 22:24:07,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:07,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:07,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:07,193 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-01-09 22:24:07,193 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-01-09 22:24:07,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-01-09 22:24:07,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 22:24:07,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:07,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:07,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 22:24:07,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:24:07,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:07,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279364827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:07,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:24:07,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 15 [2025-01-09 22:24:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849425931] [2025-01-09 22:24:07,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:07,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:24:07,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:07,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:24:07,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:24:07,946 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:08,059 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2025-01-09 22:24:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:24:08,059 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-01-09 22:24:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:08,060 INFO L225 Difference]: With dead ends: 175 [2025-01-09 22:24:08,060 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:24:08,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:24:08,060 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:08,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:24:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:24:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:24:08,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2025-01-09 22:24:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:24:08,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:24:08,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2025-01-09 22:24:08,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2025-01-09 22:24:08,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2025-01-09 22:24:08,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2025-01-09 22:24:08,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2025-01-09 22:24:08,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2025-01-09 22:24:08,071 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-01-09 22:24:08,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:08,266 INFO L422 BasicCegarLoop]: Path program histogram: [3, 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] [2025-01-09 22:24:08,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:24:08,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:24:08 BoogieIcfgContainer [2025-01-09 22:24:08,270 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:24:08,271 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:24:08,271 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:24:08,271 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:24:08,271 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:43" (3/4) ... [2025-01-09 22:24:08,273 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:24:08,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 22:24:08,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 22:24:08,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 22:24:08,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:24:08,352 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:24:08,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:24:08,355 INFO L158 Benchmark]: Toolchain (without parser) took 25905.22ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 105.4MB in the beginning and 200.2MB in the end (delta: -94.8MB). Peak memory consumption was 215.0MB. Max. memory is 16.1GB. [2025-01-09 22:24:08,355 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:24:08,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.70ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 93.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:24:08,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.14ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.9MB in the end (delta: 838.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:24:08,356 INFO L158 Benchmark]: Boogie Preprocessor took 48.66ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:24:08,356 INFO L158 Benchmark]: RCFGBuilder took 380.56ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 74.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:24:08,356 INFO L158 Benchmark]: TraceAbstraction took 25214.21ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 72.9MB in the beginning and 204.6MB in the end (delta: -131.6MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. [2025-01-09 22:24:08,356 INFO L158 Benchmark]: Witness Printer took 81.16ms. Allocated memory is still 453.0MB. Free memory was 204.6MB in the beginning and 200.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:24:08,357 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.70ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 93.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.14ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.9MB in the end (delta: 838.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.66ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 380.56ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 74.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25214.21ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 72.9MB in the beginning and 204.6MB in the end (delta: -131.6MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. * Witness Printer took 81.16ms. Allocated memory is still 453.0MB. Free memory was 204.6MB in the beginning and 200.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 37, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1654 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1654 mSDsluCounter, 3063 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2225 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3213 IncrementalHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 838 mSDtfsCounter, 3213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3287 GetRequests, 2886 SyntacticMatches, 2 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=36, InterpolantAutomatonStates: 249, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 21 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 4940 NumberOfCodeBlocks, 4151 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 6180 ConstructedInterpolants, 0 QuantifiedInterpolants, 67084 SizeOfPredicates, 25 NumberOfNonLiveVariables, 8156 ConjunctsInSsa, 254 ConjunctsInUnsatCore, 72 InterpolantComputations, 21 PerfectInterpolantSequences, 24601/25226 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:24:08,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE