./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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-bftpd/bftpd_1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:26:55,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:26:55,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:26:55,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:26:55,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:26:55,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:26:55,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:26:55,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:26:55,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:26:55,883 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:26:55,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:26:55,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:26:55,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:26:55,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:26:55,884 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:26:55,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:26:55,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:26:55,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:26:55,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:26:55,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:26:55,884 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:26:55,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:26:55,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:26:55,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:26:55,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:26:55,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:26:55,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:26:55,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:26:55,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:26:55,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:26:55,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:26:55,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:26:55,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:26:55,886 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 -> 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c [2025-02-08 06:26:56,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:26:56,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:26:56,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:26:56,064 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:26:56,064 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:26:56,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2025-02-08 06:26:57,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e6275789/b73e1ae036c6477ca30cac532848c2ed/FLAGb1f9fd821 [2025-02-08 06:26:57,402 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:26:57,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2025-02-08 06:26:57,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e6275789/b73e1ae036c6477ca30cac532848c2ed/FLAGb1f9fd821 [2025-02-08 06:26:57,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e6275789/b73e1ae036c6477ca30cac532848c2ed [2025-02-08 06:26:57,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:26:57,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:26:57,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:26:57,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:26:57,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:26:57,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:26:57" (1/1) ... [2025-02-08 06:26:57,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa1fd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:57, skipping insertion in model container [2025-02-08 06:26:57,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:26:57" (1/1) ... [2025-02-08 06:26:57,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:26:57,970 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:26:57,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:26:57,984 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:26:58,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:26:58,059 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:26:58,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58 WrapperNode [2025-02-08 06:26:58,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:26:58,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:26:58,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:26:58,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:26:58,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,092 INFO L138 Inliner]: procedures = 168, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2025-02-08 06:26:58,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:26:58,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:26:58,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:26:58,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:26:58,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,116 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 6, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2025-02-08 06:26:58,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:26:58,131 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:26:58,131 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:26:58,131 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:26:58,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (1/1) ... [2025-02-08 06:26:58,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:26:58,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:58,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:26:58,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:26:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:26:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:26:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:26:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-02-08 06:26:58,185 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-02-08 06:26:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:26:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:26:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:26:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:26:58,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:26:58,284 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:26:58,286 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:26:58,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: havoc ##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset;assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem5#1.base, #t~mem5#1.offset; [2025-02-08 06:26:58,474 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-08 06:26:58,474 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:26:58,481 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:26:58,482 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:26:58,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:58 BoogieIcfgContainer [2025-02-08 06:26:58,483 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:26:58,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:26:58,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:26:58,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:26:58,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:26:57" (1/3) ... [2025-02-08 06:26:58,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3075a985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:26:58, skipping insertion in model container [2025-02-08 06:26:58,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:58" (2/3) ... [2025-02-08 06:26:58,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3075a985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:26:58, skipping insertion in model container [2025-02-08 06:26:58,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:58" (3/3) ... [2025-02-08 06:26:58,492 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2025-02-08 06:26:58,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:26:58,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_1.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 23 error locations. [2025-02-08 06:26:58,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:26:58,547 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;@212aaa82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:26:58,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 06:26:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 61 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:26:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:26:58,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:58,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:26:58,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:26:58,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash 95601269, now seen corresponding path program 1 times [2025-02-08 06:26:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:58,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334276452] [2025-02-08 06:26:58,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:58,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:26:58,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:26:58,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:58,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334276452] [2025-02-08 06:26:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334276452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:58,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:58,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:26:58,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647439655] [2025-02-08 06:26:58,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:58,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:26:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:58,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:26:58,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:26:58,845 INFO L87 Difference]: Start difference. First operand has 66 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 61 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:58,899 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2025-02-08 06:26:58,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:58,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:26:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:58,904 INFO L225 Difference]: With dead ends: 65 [2025-02-08 06:26:58,904 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:26:58,905 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-02-08 06:26:58,909 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 106 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:58,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 54 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:26:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 06:26:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:26:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-02-08 06:26:58,938 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 5 [2025-02-08 06:26:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:58,939 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-02-08 06:26:58,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-02-08 06:26:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:26:58,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:58,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:26:58,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:26:58,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:26:58,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash 95601270, now seen corresponding path program 1 times [2025-02-08 06:26:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572622999] [2025-02-08 06:26:58,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:58,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:26:58,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:26:58,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:58,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:59,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572622999] [2025-02-08 06:26:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572622999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:59,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:26:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185589829] [2025-02-08 06:26:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:59,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:26:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:59,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:26:59,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:26:59,147 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:59,228 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2025-02-08 06:26:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:26:59,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:26:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:59,230 INFO L225 Difference]: With dead ends: 72 [2025-02-08 06:26:59,230 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 06:26:59,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:26:59,230 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 128 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:59,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 92 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 06:26:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2025-02-08 06:26:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.627906976744186) internal successors, (70), 62 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:26:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-02-08 06:26:59,236 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 5 [2025-02-08 06:26:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:59,236 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-02-08 06:26:59,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-02-08 06:26:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:26:59,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:59,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:26:59,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:26:59,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:26:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1331327931, now seen corresponding path program 1 times [2025-02-08 06:26:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782451596] [2025-02-08 06:26:59,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:59,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:26:59,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:26:59,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:59,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:59,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782451596] [2025-02-08 06:26:59,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782451596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:59,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:59,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:26:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872953313] [2025-02-08 06:26:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:59,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:26:59,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:59,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:26:59,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:26:59,441 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:59,548 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2025-02-08 06:26:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:26:59,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:26:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:59,550 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:26:59,551 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 06:26:59,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:26:59,552 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:59,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 106 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 06:26:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-02-08 06:26:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:26:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2025-02-08 06:26:59,561 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 6 [2025-02-08 06:26:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:59,561 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-02-08 06:26:59,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2025-02-08 06:26:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:26:59,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:59,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:59,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:26:59,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:26:59,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1678507123, now seen corresponding path program 1 times [2025-02-08 06:26:59,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:59,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118958107] [2025-02-08 06:26:59,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:59,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:26:59,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:26:59,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:59,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:59,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118958107] [2025-02-08 06:26:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118958107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:59,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:59,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:26:59,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948266884] [2025-02-08 06:26:59,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:59,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:26:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:59,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:26:59,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:26:59,763 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:59,843 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2025-02-08 06:26:59,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:26:59,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:26:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:59,844 INFO L225 Difference]: With dead ends: 70 [2025-02-08 06:26:59,844 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 06:26:59,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:26:59,846 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 75 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:59,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 120 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 06:26:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2025-02-08 06:26:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 62 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:26:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-02-08 06:26:59,852 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 7 [2025-02-08 06:26:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:59,854 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-02-08 06:26:59,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-02-08 06:26:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:26:59,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:59,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:59,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:26:59,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:26:59,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash 494113283, now seen corresponding path program 1 times [2025-02-08 06:26:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361910696] [2025-02-08 06:26:59,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:59,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:26:59,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:26:59,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:59,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:59,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:59,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361910696] [2025-02-08 06:26:59,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361910696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:59,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:59,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:26:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615574868] [2025-02-08 06:26:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:59,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:26:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:59,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:26:59,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:26:59,928 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:00,003 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2025-02-08 06:27:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:27:00,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 06:27:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:00,006 INFO L225 Difference]: With dead ends: 120 [2025-02-08 06:27:00,006 INFO L226 Difference]: Without dead ends: 120 [2025-02-08 06:27:00,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:27:00,006 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 168 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:00,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-08 06:27:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2025-02-08 06:27:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.5625) internal successors, (100), 83 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2025-02-08 06:27:00,019 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 8 [2025-02-08 06:27:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:00,019 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2025-02-08 06:27:00,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2025-02-08 06:27:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:27:00,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:00,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:00,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:27:00,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:00,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1862357391, now seen corresponding path program 1 times [2025-02-08 06:27:00,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:00,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645694236] [2025-02-08 06:27:00,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:00,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:27:00,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:27:00,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:00,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:00,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:00,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645694236] [2025-02-08 06:27:00,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645694236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:00,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:00,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:27:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439479370] [2025-02-08 06:27:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:00,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:27:00,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:00,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:27:00,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:27:00,117 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:00,226 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2025-02-08 06:27:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:27:00,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:27:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:00,227 INFO L225 Difference]: With dead ends: 117 [2025-02-08 06:27:00,227 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 06:27:00,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:27:00,228 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 166 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:00,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 126 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 06:27:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2025-02-08 06:27:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.53125) internal successors, (98), 83 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2025-02-08 06:27:00,240 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 9 [2025-02-08 06:27:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:00,240 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2025-02-08 06:27:00,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2025-02-08 06:27:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:27:00,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:00,240 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:00,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:27:00,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:00,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2084063231, now seen corresponding path program 1 times [2025-02-08 06:27:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:00,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700125239] [2025-02-08 06:27:00,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:00,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:27:00,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:27:00,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:00,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:00,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:00,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700125239] [2025-02-08 06:27:00,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700125239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:00,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993356265] [2025-02-08 06:27:00,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:00,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:00,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:00,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:00,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:27:00,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:27:00,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:27:00,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:00,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:00,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 06:27:00,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:00,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993356265] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:00,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-02-08 06:27:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490294870] [2025-02-08 06:27:00,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:00,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:27:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:00,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:27:00,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:00,680 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:00,781 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2025-02-08 06:27:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:27:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-08 06:27:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:00,782 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:27:00,782 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:27:00,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:27:00,783 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 182 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:00,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 210 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:27:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2025-02-08 06:27:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 83 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2025-02-08 06:27:00,787 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 13 [2025-02-08 06:27:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:00,787 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2025-02-08 06:27:00,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2025-02-08 06:27:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:27:00,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:00,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:00,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:27:00,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:00,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:00,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash 181450716, now seen corresponding path program 1 times [2025-02-08 06:27:00,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:00,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125735150] [2025-02-08 06:27:00,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:00,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:27:01,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:27:01,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:01,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:01,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:01,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125735150] [2025-02-08 06:27:01,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125735150] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:01,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589510464] [2025-02-08 06:27:01,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:01,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:01,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:01,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:01,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:27:01,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:27:01,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:27:01,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:01,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:01,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 06:27:01,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:01,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589510464] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:01,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-02-08 06:27:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415495359] [2025-02-08 06:27:01,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:01,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:27:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:01,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:27:01,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:27:01,424 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:01,571 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-02-08 06:27:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:27:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 06:27:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:01,572 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:27:01,572 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:27:01,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:27:01,573 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:01,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 254 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:27:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2025-02-08 06:27:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 82 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2025-02-08 06:27:01,578 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 14 [2025-02-08 06:27:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:01,579 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2025-02-08 06:27:01,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2025-02-08 06:27:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:27:01,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:01,579 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:01,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:27:01,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:01,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:01,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:01,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1330004924, now seen corresponding path program 1 times [2025-02-08 06:27:01,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:01,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598661744] [2025-02-08 06:27:01,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:01,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:01,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:27:01,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:27:01,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:01,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:01,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598661744] [2025-02-08 06:27:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598661744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487000538] [2025-02-08 06:27:01,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:01,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:01,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:01,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:02,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:27:02,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:27:02,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:27:02,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:02,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:02,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:27:02,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:02,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487000538] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:02,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-02-08 06:27:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611805193] [2025-02-08 06:27:02,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:02,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:27:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:02,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:27:02,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:27:02,459 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:02,690 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2025-02-08 06:27:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:27:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 06:27:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:02,691 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:27:02,691 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:27:02,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:27:02,691 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 115 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:02,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 394 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:27:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2025-02-08 06:27:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.373134328358209) internal successors, (92), 81 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2025-02-08 06:27:02,697 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 15 [2025-02-08 06:27:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:02,697 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2025-02-08 06:27:02,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2025-02-08 06:27:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:27:02,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:02,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:02,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:27:02,902 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-02-08 06:27:02,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:02,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:02,903 INFO L85 PathProgramCache]: Analyzing trace with hash 649608379, now seen corresponding path program 1 times [2025-02-08 06:27:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:02,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026417422] [2025-02-08 06:27:02,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:02,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:27:02,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:27:02,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:02,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026417422] [2025-02-08 06:27:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026417422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:02,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:27:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787851905] [2025-02-08 06:27:02,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:02,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:27:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:02,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:27:02,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:27:02,933 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:02,938 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2025-02-08 06:27:02,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:27:02,939 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 06:27:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:02,939 INFO L225 Difference]: With dead ends: 84 [2025-02-08 06:27:02,939 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 06:27:02,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:27:02,939 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:02,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 06:27:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-08 06:27:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.328358208955224) internal successors, (89), 78 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2025-02-08 06:27:02,942 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 17 [2025-02-08 06:27:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:02,942 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2025-02-08 06:27:02,942 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2025-02-08 06:27:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:27:02,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:02,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:02,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:27:02,942 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:02,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:02,943 INFO L85 PathProgramCache]: Analyzing trace with hash 649608403, now seen corresponding path program 1 times [2025-02-08 06:27:02,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:02,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336334948] [2025-02-08 06:27:02,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:02,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:02,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:27:02,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:27:02,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:02,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336334948] [2025-02-08 06:27:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336334948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:27:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502995563] [2025-02-08 06:27:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:02,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:27:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:02,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:27:02,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:27:02,964 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:02,966 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2025-02-08 06:27:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:27:02,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 06:27:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:02,966 INFO L225 Difference]: With dead ends: 73 [2025-02-08 06:27:02,966 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 06:27:02,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:27:02,967 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:02,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 06:27:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-08 06:27:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.278688524590164) internal successors, (78), 67 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2025-02-08 06:27:02,969 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 17 [2025-02-08 06:27:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:02,969 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2025-02-08 06:27:02,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2025-02-08 06:27:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:27:02,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:02,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:02,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:27:02,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:02,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1336976742, now seen corresponding path program 1 times [2025-02-08 06:27:02,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:02,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479060518] [2025-02-08 06:27:02,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:02,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:02,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:27:02,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:27:02,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:02,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:03,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:03,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479060518] [2025-02-08 06:27:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479060518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:03,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:03,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:27:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716799971] [2025-02-08 06:27:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:03,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:27:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:03,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:27:03,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:27:03,003 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:03,016 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2025-02-08 06:27:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:27:03,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 06:27:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:03,017 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:27:03,017 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:27:03,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:27:03,018 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:03,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:27:03,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 06:27:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-02-08 06:27:03,019 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 18 [2025-02-08 06:27:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:03,019 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-02-08 06:27:03,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-02-08 06:27:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:27:03,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:03,020 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:03,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:27:03,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:03,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash 617049025, now seen corresponding path program 1 times [2025-02-08 06:27:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482877941] [2025-02-08 06:27:03,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:03,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:03,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:27:03,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:27:03,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:03,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:03,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482877941] [2025-02-08 06:27:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482877941] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687495654] [2025-02-08 06:27:03,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:03,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:03,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:03,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:03,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:27:03,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:27:03,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:27:03,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:03,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:03,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 06:27:03,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:03,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:03,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687495654] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:03,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:03,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 06:27:03,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022345776] [2025-02-08 06:27:03,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:03,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:27:03,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:03,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:27:03,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:27:03,310 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:27:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:03,399 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-02-08 06:27:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:27:03,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-08 06:27:03,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:03,401 INFO L225 Difference]: With dead ends: 82 [2025-02-08 06:27:03,401 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 06:27:03,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:03,401 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 67 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:03,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 61 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 06:27:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-02-08 06:27:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-02-08 06:27:03,403 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 29 [2025-02-08 06:27:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:03,403 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-02-08 06:27:03,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:27:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-02-08 06:27:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:27:03,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:03,404 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:03,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:27:03,608 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,SelfDestructingSolverStorable12 [2025-02-08 06:27:03,608 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:03,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1948650611, now seen corresponding path program 1 times [2025-02-08 06:27:03,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:03,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813815275] [2025-02-08 06:27:03,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:03,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:27:03,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:27:03,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:03,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813815275] [2025-02-08 06:27:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813815275] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893119453] [2025-02-08 06:27:03,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:03,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:03,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:03,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:03,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:27:03,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:27:03,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:27:03,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:03,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:03,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 06:27:03,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:03,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:03,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893119453] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:03,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:03,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 06:27:03,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794411789] [2025-02-08 06:27:03,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:03,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:27:03,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:03,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:27:03,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:03,974 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:04,071 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-02-08 06:27:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:27:04,072 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2025-02-08 06:27:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:04,073 INFO L225 Difference]: With dead ends: 81 [2025-02-08 06:27:04,073 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 06:27:04,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:27:04,073 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:04,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 77 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 06:27:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 06:27:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-02-08 06:27:04,075 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 30 [2025-02-08 06:27:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:04,078 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-02-08 06:27:04,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-02-08 06:27:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 06:27:04,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:04,079 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:04,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:27:04,279 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,SelfDestructingSolverStorable13 [2025-02-08 06:27:04,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash -130620285, now seen corresponding path program 1 times [2025-02-08 06:27:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:04,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612092989] [2025-02-08 06:27:04,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:04,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 06:27:04,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 06:27:04,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:04,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612092989] [2025-02-08 06:27:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612092989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550921022] [2025-02-08 06:27:04,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:04,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:04,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:04,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:27:04,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 06:27:04,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 06:27:04,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:04,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:04,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 06:27:04,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:04,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550921022] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:04,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 06:27:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826077527] [2025-02-08 06:27:04,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:04,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:27:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:04,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:27:04,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:27:04,672 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:27:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:04,736 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2025-02-08 06:27:04,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:27:04,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-02-08 06:27:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:04,736 INFO L225 Difference]: With dead ends: 80 [2025-02-08 06:27:04,736 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 06:27:04,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:04,737 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 70 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:04,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 47 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 06:27:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-08 06:27:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 73 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-02-08 06:27:04,739 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 50 [2025-02-08 06:27:04,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:04,739 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-02-08 06:27:04,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:27:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-02-08 06:27:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:27:04,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:04,742 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:04,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:27:04,946 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,SelfDestructingSolverStorable14 [2025-02-08 06:27:04,947 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:04,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash 245738481, now seen corresponding path program 1 times [2025-02-08 06:27:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:04,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079361228] [2025-02-08 06:27:04,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:04,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:27:04,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:27:04,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:04,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:05,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:05,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079361228] [2025-02-08 06:27:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079361228] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:05,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631939795] [2025-02-08 06:27:05,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:05,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:05,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:05,088 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:05,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:27:05,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:27:05,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:27:05,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:05,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:05,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 06:27:05,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:05,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:05,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631939795] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:05,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:05,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 06:27:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204221509] [2025-02-08 06:27:05,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:27:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:05,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:27:05,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:05,379 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:27:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:05,461 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-02-08 06:27:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:27:05,461 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2025-02-08 06:27:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:05,462 INFO L225 Difference]: With dead ends: 79 [2025-02-08 06:27:05,462 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 06:27:05,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:27:05,462 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:05,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 82 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 06:27:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-08 06:27:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.125) internal successors, (81), 72 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-02-08 06:27:05,464 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 51 [2025-02-08 06:27:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:05,464 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-02-08 06:27:05,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:27:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-02-08 06:27:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:27:05,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:05,465 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:05,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:27:05,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:05,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-02-08 06:27:05,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1716407968, now seen corresponding path program 1 times [2025-02-08 06:27:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:05,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648464766] [2025-02-08 06:27:05,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:05,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:27:05,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:27:05,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:05,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-08 06:27:05,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648464766] [2025-02-08 06:27:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648464766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:05,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:27:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073135053] [2025-02-08 06:27:05,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:05,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:27:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:05,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:27:05,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:27:05,730 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:27:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:05,744 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-02-08 06:27:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:27:05,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2025-02-08 06:27:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:05,745 INFO L225 Difference]: With dead ends: 78 [2025-02-08 06:27:05,745 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:27:05,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:27:05,745 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:05,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:27:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:27:05,746 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-02-08 06:27:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:27:05,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2025-02-08 06:27:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:05,746 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:27:05,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:27:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:27:05,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE (22 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE (21 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (20 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr3ASSERT_VIOLATIONMEMORY_FREE (19 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr4ASSERT_VIOLATIONMEMORY_FREE (18 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE (17 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr6ASSERT_VIOLATIONMEMORY_FREE (16 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE (15 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE (14 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr9ASSERT_VIOLATIONMEMORY_FREE (13 of 23 remaining) [2025-02-08 06:27:05,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (12 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (11 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-02-08 06:27:05,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2025-02-08 06:27:05,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:27:05,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:05,756 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:27:05,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:27:05 BoogieIcfgContainer [2025-02-08 06:27:05,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:27:05,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:27:05,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:27:05,758 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:27:05,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:58" (3/4) ... [2025-02-08 06:27:05,760 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:27:05,764 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure parse_input [2025-02-08 06:27:05,766 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-08 06:27:05,766 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 06:27:05,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 06:27:05,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 06:27:05,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:27:05,814 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:27:05,814 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:27:05,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:27:05,815 INFO L158 Benchmark]: Toolchain (without parser) took 8118.62ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 107.2MB in the beginning and 100.2MB in the end (delta: 7.1MB). Peak memory consumption was 145.5MB. Max. memory is 16.1GB. [2025-02-08 06:27:05,815 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:27:05,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.90ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 87.1MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 06:27:05,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.25ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 85.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:27:05,815 INFO L158 Benchmark]: Boogie Preprocessor took 37.73ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:27:05,815 INFO L158 Benchmark]: IcfgBuilder took 351.77ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 66.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:27:05,816 INFO L158 Benchmark]: TraceAbstraction took 7273.29ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 65.7MB in the beginning and 105.7MB in the end (delta: -40.0MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2025-02-08 06:27:05,816 INFO L158 Benchmark]: Witness Printer took 56.30ms. Allocated memory is still 276.8MB. Free memory was 105.7MB in the beginning and 100.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:27:05,817 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.90ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 87.1MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.25ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 85.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.73ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 351.77ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 66.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7273.29ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 65.7MB in the beginning and 105.7MB in the end (delta: -40.0MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. * Witness Printer took 56.30ms. Allocated memory is still 276.8MB. Free memory was 105.7MB in the beginning and 100.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. 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: 719]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 719]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 719]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 718]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 718]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 718]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 715]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 715]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 715]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 707]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 707]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 707]: free always succeeds For all program executions holds that free 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: 693]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 693]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 693]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 693]: 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: 722]: 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 2 procedures, 66 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1418 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1418 mSDsluCounter, 1919 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1265 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1211 IncrementalHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 654 mSDtfsCounter, 1211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=5, InterpolantAutomatonStates: 90, 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, 17 MinimizatonAttempts, 81 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 562 NumberOfCodeBlocks, 562 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 6039 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1370 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 31 InterpolantComputations, 10 PerfectInterpolantSequences, 570/831 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 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:27:05,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE