./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:41:05,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:05,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:41:05,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:05,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:05,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:05,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:05,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:05,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:05,182 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:05,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:05,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:05,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:05,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:05,182 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:05,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:05,183 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:05,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:05,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:05,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:05,184 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:05,184 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:05,185 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:05,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:05,185 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:05,185 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:05,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:05,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:05,186 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2025-03-04 07:41:05,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:05,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:05,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:05,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:05,442 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:05,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2025-03-04 07:41:06,615 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4680365fe/d47c4911acab4873b1fd483592d1a59d/FLAG4b651a646 [2025-03-04 07:41:06,902 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:06,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2025-03-04 07:41:06,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4680365fe/d47c4911acab4873b1fd483592d1a59d/FLAG4b651a646 [2025-03-04 07:41:06,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4680365fe/d47c4911acab4873b1fd483592d1a59d [2025-03-04 07:41:06,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:06,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:06,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:06,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:06,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:06,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d804c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06, skipping insertion in model container [2025-03-04 07:41:06,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:07,231 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:07,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:07,246 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:41:07,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:07,324 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:41:07,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07 WrapperNode [2025-03-04 07:41:07,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:07,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:07,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:41:07,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:41:07,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,362 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-03-04 07:41:07,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:07,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:41:07,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:41:07,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:41:07,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,391 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-03-04 07:41:07,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:41:07,408 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:41:07,408 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:41:07,408 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:41:07,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:07,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:07,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:41:07,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:41:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:41:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:41:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:41:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-03-04 07:41:07,464 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-03-04 07:41:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:41:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:41:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:41:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:41:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:41:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:41:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:41:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:41:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:41:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:41:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:41:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:41:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:41:07,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:41:07,565 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:41:07,568 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:41:07,736 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-04 07:41:07,737 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:41:07,744 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:41:07,744 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:41:07,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:07 BoogieIcfgContainer [2025-03-04 07:41:07,746 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:41:07,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:41:07,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:41:07,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:41:07,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:41:06" (1/3) ... [2025-03-04 07:41:07,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff16344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:07, skipping insertion in model container [2025-03-04 07:41:07,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07" (2/3) ... [2025-03-04 07:41:07,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff16344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:07, skipping insertion in model container [2025-03-04 07:41:07,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:07" (3/3) ... [2025-03-04 07:41:07,755 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2025-03-04 07:41:07,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:07,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_3.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-03-04 07:41:07,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:07,814 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;@1fc640fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:07,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 07:41:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 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-03-04 07:41:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:07,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:07,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:07,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:07,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1396543346, now seen corresponding path program 1 times [2025-03-04 07:41:07,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:07,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891681116] [2025-03-04 07:41:07,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:07,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:07,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:07,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:07,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:07,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891681116] [2025-03-04 07:41:08,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891681116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:08,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:08,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787150142] [2025-03-04 07:41:08,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:08,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:08,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:08,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:08,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:08,111 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:08,237 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2025-03-04 07:41:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:08,243 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:41:08,243 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 07:41:08,245 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-03-04 07:41:08,247 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 145 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:08,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 104 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 07:41:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2025-03-04 07:41:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.65) internal successors, (99), 77 states have internal predecessors, (99), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 07:41:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2025-03-04 07:41:08,276 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 6 [2025-03-04 07:41:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:08,276 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2025-03-04 07:41:08,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2025-03-04 07:41:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:08,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:08,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:08,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:41:08,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:08,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1396543345, now seen corresponding path program 1 times [2025-03-04 07:41:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653080625] [2025-03-04 07:41:08,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:08,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:08,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:08,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:08,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:08,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:08,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653080625] [2025-03-04 07:41:08,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653080625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:08,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:08,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405592577] [2025-03-04 07:41:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:08,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:08,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:08,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:08,419 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:08,553 INFO L93 Difference]: Finished difference Result 186 states and 250 transitions. [2025-03-04 07:41:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:08,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:08,555 INFO L225 Difference]: With dead ends: 186 [2025-03-04 07:41:08,555 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 07:41:08,556 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-03-04 07:41:08,556 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 153 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:08,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 140 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 07:41:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 160. [2025-03-04 07:41:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.6666666666666667) internal successors, (210), 143 states have internal predecessors, (210), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 07:41:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 246 transitions. [2025-03-04 07:41:08,567 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 246 transitions. Word has length 6 [2025-03-04 07:41:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:08,567 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 246 transitions. [2025-03-04 07:41:08,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 246 transitions. [2025-03-04 07:41:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:41:08,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:08,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:08,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:41:08,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:08,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash -343170744, now seen corresponding path program 1 times [2025-03-04 07:41:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:08,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700379061] [2025-03-04 07:41:08,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:08,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:41:08,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:41:08,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:08,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700379061] [2025-03-04 07:41:08,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700379061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:08,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:08,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:08,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487897708] [2025-03-04 07:41:08,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:08,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:08,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:08,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:08,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:08,750 INFO L87 Difference]: Start difference. First operand 160 states and 246 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-03-04 07:41:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:08,867 INFO L93 Difference]: Finished difference Result 205 states and 295 transitions. [2025-03-04 07:41:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:08,868 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-03-04 07:41:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:08,869 INFO L225 Difference]: With dead ends: 205 [2025-03-04 07:41:08,869 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 07:41:08,870 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-03-04 07:41:08,870 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 79 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:08,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 158 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 07:41:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2025-03-04 07:41:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 146 states have internal predecessors, (213), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 07:41:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 249 transitions. [2025-03-04 07:41:08,887 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 249 transitions. Word has length 7 [2025-03-04 07:41:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:08,887 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 249 transitions. [2025-03-04 07:41:08,887 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-03-04 07:41:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 249 transitions. [2025-03-04 07:41:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:41:08,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:08,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:08,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:41:08,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:08,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2048358452, now seen corresponding path program 1 times [2025-03-04 07:41:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:08,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451911171] [2025-03-04 07:41:08,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:08,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:41:08,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:41:08,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:08,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:09,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:09,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451911171] [2025-03-04 07:41:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451911171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:09,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:09,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664500465] [2025-03-04 07:41:09,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:09,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:09,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:09,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:09,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:09,070 INFO L87 Difference]: Start difference. First operand 163 states and 249 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-03-04 07:41:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:09,183 INFO L93 Difference]: Finished difference Result 188 states and 251 transitions. [2025-03-04 07:41:09,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:09,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-03-04 07:41:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:09,185 INFO L225 Difference]: With dead ends: 188 [2025-03-04 07:41:09,185 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 07:41:09,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:09,185 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 69 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:09,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 193 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 07:41:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2025-03-04 07:41:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 146 states have internal predecessors, (211), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 07:41:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2025-03-04 07:41:09,199 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 8 [2025-03-04 07:41:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:09,199 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2025-03-04 07:41:09,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-03-04 07:41:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2025-03-04 07:41:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:41:09,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:09,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:09,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:41:09,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:09,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash 925397446, now seen corresponding path program 1 times [2025-03-04 07:41:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:09,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524626246] [2025-03-04 07:41:09,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:09,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:09,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:41:09,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:09,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524626246] [2025-03-04 07:41:09,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524626246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:09,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819224617] [2025-03-04 07:41:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:09,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:09,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:09,266 INFO L87 Difference]: Start difference. First operand 163 states and 247 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-03-04 07:41:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:09,343 INFO L93 Difference]: Finished difference Result 245 states and 337 transitions. [2025-03-04 07:41:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:09,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-03-04 07:41:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:09,344 INFO L225 Difference]: With dead ends: 245 [2025-03-04 07:41:09,345 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 07:41:09,345 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-03-04 07:41:09,345 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 131 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:09,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 175 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 07:41:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 196. [2025-03-04 07:41:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.60625) internal successors, (257), 178 states have internal predecessors, (257), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 07:41:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 293 transitions. [2025-03-04 07:41:09,359 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 293 transitions. Word has length 9 [2025-03-04 07:41:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:09,359 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 293 transitions. [2025-03-04 07:41:09,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-03-04 07:41:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 293 transitions. [2025-03-04 07:41:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:09,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:09,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:09,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:41:09,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1377450230, now seen corresponding path program 1 times [2025-03-04 07:41:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278161383] [2025-03-04 07:41:09,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:09,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:09,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:09,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:09,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:09,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278161383] [2025-03-04 07:41:09,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278161383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:09,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:09,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:09,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534633281] [2025-03-04 07:41:09,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:09,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:09,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:09,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:09,439 INFO L87 Difference]: Start difference. First operand 196 states and 293 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:09,526 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2025-03-04 07:41:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:09,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2025-03-04 07:41:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:09,528 INFO L225 Difference]: With dead ends: 244 [2025-03-04 07:41:09,530 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 07:41:09,530 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-03-04 07:41:09,530 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 138 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:09,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 208 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 07:41:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2025-03-04 07:41:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 173 states have (on average 1.606936416184971) internal successors, (278), 192 states have internal predecessors, (278), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 07:41:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 314 transitions. [2025-03-04 07:41:09,539 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 314 transitions. Word has length 10 [2025-03-04 07:41:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:09,540 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 314 transitions. [2025-03-04 07:41:09,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 314 transitions. [2025-03-04 07:41:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:41:09,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:09,540 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:09,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:41:09,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:09,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash 675125788, now seen corresponding path program 1 times [2025-03-04 07:41:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409075627] [2025-03-04 07:41:09,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:09,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:09,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:41:09,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:09,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:09,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409075627] [2025-03-04 07:41:09,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409075627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:09,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434663685] [2025-03-04 07:41:09,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:09,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:09,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:09,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:41:09,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:09,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:41:09,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:09,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:09,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:09,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434663685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:09,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-03-04 07:41:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673863665] [2025-03-04 07:41:09,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:09,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:41:09,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:09,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:41:09,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:09,998 INFO L87 Difference]: Start difference. First operand 210 states and 314 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-03-04 07:41:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:10,156 INFO L93 Difference]: Finished difference Result 236 states and 313 transitions. [2025-03-04 07:41:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:10,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-03-04 07:41:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:10,157 INFO L225 Difference]: With dead ends: 236 [2025-03-04 07:41:10,157 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 07:41:10,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 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-03-04 07:41:10,158 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 203 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:10,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 428 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 07:41:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 213. [2025-03-04 07:41:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 195 states have internal predecessors, (272), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 07:41:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2025-03-04 07:41:10,164 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 14 [2025-03-04 07:41:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:10,164 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2025-03-04 07:41:10,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-03-04 07:41:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2025-03-04 07:41:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:41:10,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:10,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:10,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:10,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:10,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:10,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash -545937061, now seen corresponding path program 1 times [2025-03-04 07:41:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:10,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761981338] [2025-03-04 07:41:10,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:10,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:10,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:10,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:10,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:10,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761981338] [2025-03-04 07:41:10,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761981338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074779826] [2025-03-04 07:41:10,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:10,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:10,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:10,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:10,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:41:10,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:10,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:10,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:10,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:10,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:10,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:10,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:10,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074779826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:10,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:10,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-04 07:41:10,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769048820] [2025-03-04 07:41:10,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:10,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:41:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:10,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:41:10,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:41:10,730 INFO L87 Difference]: Start difference. First operand 213 states and 308 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-03-04 07:41:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:10,983 INFO L93 Difference]: Finished difference Result 256 states and 353 transitions. [2025-03-04 07:41:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:41:10,984 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-03-04 07:41:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:10,985 INFO L225 Difference]: With dead ends: 256 [2025-03-04 07:41:10,985 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 07:41:10,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 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-03-04 07:41:10,985 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:10,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 414 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 07:41:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 221. [2025-03-04 07:41:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 203 states have internal predecessors, (283), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 07:41:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 319 transitions. [2025-03-04 07:41:10,993 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 319 transitions. Word has length 15 [2025-03-04 07:41:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:10,994 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 319 transitions. [2025-03-04 07:41:10,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-03-04 07:41:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 319 transitions. [2025-03-04 07:41:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:41:10,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:10,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:11,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:11,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 07:41:11,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:11,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash 255820313, now seen corresponding path program 1 times [2025-03-04 07:41:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:11,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158004225] [2025-03-04 07:41:11,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:11,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:41:11,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:41:11,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:11,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:11,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158004225] [2025-03-04 07:41:11,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158004225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324391012] [2025-03-04 07:41:11,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:11,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:11,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:11,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:41:11,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:41:11,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:41:11,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:41:11,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:11,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:11,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324391012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:11,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:11,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-04 07:41:11,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472544863] [2025-03-04 07:41:11,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:11,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:11,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:11,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:11,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:11,661 INFO L87 Difference]: Start difference. First operand 221 states and 319 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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-03-04 07:41:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,039 INFO L93 Difference]: Finished difference Result 355 states and 471 transitions. [2025-03-04 07:41:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:41:12,040 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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 16 [2025-03-04 07:41:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,043 INFO L225 Difference]: With dead ends: 355 [2025-03-04 07:41:12,043 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 07:41:12,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:41:12,044 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 272 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:12,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 584 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 07:41:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 292. [2025-03-04 07:41:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 251 states have (on average 1.5577689243027888) internal successors, (391), 272 states have internal predecessors, (391), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 07:41:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 434 transitions. [2025-03-04 07:41:12,054 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 434 transitions. Word has length 16 [2025-03-04 07:41:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,054 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 434 transitions. [2025-03-04 07:41:12,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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-03-04 07:41:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 434 transitions. [2025-03-04 07:41:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:12,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:12,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:41:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:12,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:12,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash -104694343, now seen corresponding path program 1 times [2025-03-04 07:41:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21291420] [2025-03-04 07:41:12,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:12,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:12,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:12,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21291420] [2025-03-04 07:41:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21291420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:12,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371727100] [2025-03-04 07:41:12,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:12,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:12,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:12,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:12,288 INFO L87 Difference]: Start difference. First operand 292 states and 434 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-03-04 07:41:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,302 INFO L93 Difference]: Finished difference Result 428 states and 642 transitions. [2025-03-04 07:41:12,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:12,303 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-03-04 07:41:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,304 INFO L225 Difference]: With dead ends: 428 [2025-03-04 07:41:12,304 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 07:41:12,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:12,305 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 47 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:12,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 07:41:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 411. [2025-03-04 07:41:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 361 states have (on average 1.5650969529085872) internal successors, (565), 384 states have internal predecessors, (565), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-03-04 07:41:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 634 transitions. [2025-03-04 07:41:12,315 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 634 transitions. Word has length 18 [2025-03-04 07:41:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,315 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 634 transitions. [2025-03-04 07:41:12,315 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-03-04 07:41:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 634 transitions. [2025-03-04 07:41:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:12,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:12,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:41:12,316 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:12,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,317 INFO L85 PathProgramCache]: Analyzing trace with hash -104694319, now seen corresponding path program 1 times [2025-03-04 07:41:12,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480681445] [2025-03-04 07:41:12,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:12,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:12,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480681445] [2025-03-04 07:41:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480681445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:12,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:12,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817067014] [2025-03-04 07:41:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:12,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:12,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:12,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:12,340 INFO L87 Difference]: Start difference. First operand 411 states and 634 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-03-04 07:41:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,345 INFO L93 Difference]: Finished difference Result 373 states and 568 transitions. [2025-03-04 07:41:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-03-04 07:41:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,347 INFO L225 Difference]: With dead ends: 373 [2025-03-04 07:41:12,347 INFO L226 Difference]: Without dead ends: 373 [2025-03-04 07:41:12,347 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-03-04 07:41:12,347 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:12,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-04 07:41:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-04 07:41:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 329 states have (on average 1.5167173252279635) internal successors, (499), 346 states have internal predecessors, (499), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-03-04 07:41:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 568 transitions. [2025-03-04 07:41:12,363 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 568 transitions. Word has length 18 [2025-03-04 07:41:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 568 transitions. [2025-03-04 07:41:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-03-04 07:41:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 568 transitions. [2025-03-04 07:41:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:41:12,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:12,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:41:12,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:12,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1049442653, now seen corresponding path program 1 times [2025-03-04 07:41:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835586304] [2025-03-04 07:41:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:41:12,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:41:12,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:12,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835586304] [2025-03-04 07:41:12,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835586304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:12,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:12,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397101780] [2025-03-04 07:41:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:12,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:12,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:12,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:12,410 INFO L87 Difference]: Start difference. First operand 373 states and 568 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,433 INFO L93 Difference]: Finished difference Result 438 states and 647 transitions. [2025-03-04 07:41:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:12,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 19 [2025-03-04 07:41:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,436 INFO L225 Difference]: With dead ends: 438 [2025-03-04 07:41:12,436 INFO L226 Difference]: Without dead ends: 438 [2025-03-04 07:41:12,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:12,436 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:12,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-04 07:41:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 421. [2025-03-04 07:41:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 373 states have (on average 1.5120643431635388) internal successors, (564), 392 states have internal predecessors, (564), 16 states have call successors, (16), 12 states have call predecessors, (16), 20 states have return successors, (57), 16 states have call predecessors, (57), 16 states have call successors, (57) [2025-03-04 07:41:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 637 transitions. [2025-03-04 07:41:12,446 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 637 transitions. Word has length 19 [2025-03-04 07:41:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,446 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 637 transitions. [2025-03-04 07:41:12,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 637 transitions. [2025-03-04 07:41:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:41:12,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:12,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:41:12,447 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:12,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1554979290, now seen corresponding path program 1 times [2025-03-04 07:41:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013404813] [2025-03-04 07:41:12,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:41:12,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:41:12,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013404813] [2025-03-04 07:41:12,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013404813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:12,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:12,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723837027] [2025-03-04 07:41:12,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:12,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:12,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:12,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:12,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:12,481 INFO L87 Difference]: Start difference. First operand 421 states and 637 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,488 INFO L93 Difference]: Finished difference Result 292 states and 421 transitions. [2025-03-04 07:41:12,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:12,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 07:41:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,490 INFO L225 Difference]: With dead ends: 292 [2025-03-04 07:41:12,490 INFO L226 Difference]: Without dead ends: 292 [2025-03-04 07:41:12,490 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-03-04 07:41:12,490 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:12,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 94 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-04 07:41:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2025-03-04 07:41:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 255 states have (on average 1.4784313725490197) internal successors, (377), 271 states have internal predecessors, (377), 11 states have call successors, (11), 8 states have call predecessors, (11), 13 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 07:41:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 420 transitions. [2025-03-04 07:41:12,496 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 420 transitions. Word has length 25 [2025-03-04 07:41:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,496 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 420 transitions. [2025-03-04 07:41:12,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 420 transitions. [2025-03-04 07:41:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:41:12,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:12,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:41:12,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:12,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2014690822, now seen corresponding path program 1 times [2025-03-04 07:41:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029405830] [2025-03-04 07:41:12,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:12,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:12,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029405830] [2025-03-04 07:41:12,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029405830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:12,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:12,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:41:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993757185] [2025-03-04 07:41:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:12,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:12,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:12,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:12,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:12,562 INFO L87 Difference]: Start difference. First operand 291 states and 420 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,616 INFO L93 Difference]: Finished difference Result 314 states and 436 transitions. [2025-03-04 07:41:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 07:41:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,618 INFO L225 Difference]: With dead ends: 314 [2025-03-04 07:41:12,618 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 07:41:12,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:41:12,619 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:12,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 168 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 07:41:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 295. [2025-03-04 07:41:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 257 states have (on average 1.4630350194552528) internal successors, (376), 275 states have internal predecessors, (376), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 07:41:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 419 transitions. [2025-03-04 07:41:12,628 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 419 transitions. Word has length 27 [2025-03-04 07:41:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,628 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 419 transitions. [2025-03-04 07:41:12,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 419 transitions. [2025-03-04 07:41:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:41:12,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:12,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:41:12,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:12,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1818177317, now seen corresponding path program 1 times [2025-03-04 07:41:12,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151247193] [2025-03-04 07:41:12,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:12,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:12,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:12,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151247193] [2025-03-04 07:41:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151247193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002416690] [2025-03-04 07:41:12,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:12,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:12,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:12,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:41:12,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:12,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:12,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:41:12,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:13,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:13,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:13,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:13,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002416690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:13,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:13,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2025-03-04 07:41:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185861568] [2025-03-04 07:41:13,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:13,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:41:13,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:13,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:41:13,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:41:13,281 INFO L87 Difference]: Start difference. First operand 295 states and 419 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:13,574 INFO L93 Difference]: Finished difference Result 311 states and 420 transitions. [2025-03-04 07:41:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:41:13,574 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-04 07:41:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:13,575 INFO L225 Difference]: With dead ends: 311 [2025-03-04 07:41:13,575 INFO L226 Difference]: Without dead ends: 311 [2025-03-04 07:41:13,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:41:13,576 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 293 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:13,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 115 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-04 07:41:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2025-03-04 07:41:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 261 states have (on average 1.417624521072797) internal successors, (370), 279 states have internal predecessors, (370), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 07:41:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 413 transitions. [2025-03-04 07:41:13,584 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 413 transitions. Word has length 27 [2025-03-04 07:41:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:13,585 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 413 transitions. [2025-03-04 07:41:13,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 413 transitions. [2025-03-04 07:41:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:41:13,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:13,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:13,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:41:13,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 07:41:13,786 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:13,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash -742854348, now seen corresponding path program 1 times [2025-03-04 07:41:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127164189] [2025-03-04 07:41:13,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:13,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:41:13,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:41:13,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:13,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127164189] [2025-03-04 07:41:13,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127164189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696791445] [2025-03-04 07:41:13,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:13,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:13,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:13,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:13,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:41:13,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:41:13,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:41:13,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:13,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:13,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:13,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:14,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:14,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696791445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:14,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:41:14,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-03-04 07:41:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954052646] [2025-03-04 07:41:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:14,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:41:14,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:14,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:41:14,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:14,061 INFO L87 Difference]: Start difference. First operand 299 states and 413 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:14,108 INFO L93 Difference]: Finished difference Result 320 states and 430 transitions. [2025-03-04 07:41:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:14,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 07:41:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:14,110 INFO L225 Difference]: With dead ends: 320 [2025-03-04 07:41:14,110 INFO L226 Difference]: Without dead ends: 320 [2025-03-04 07:41:14,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:14,111 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 62 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:14,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 134 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-04 07:41:14,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 310. [2025-03-04 07:41:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 272 states have (on average 1.400735294117647) internal successors, (381), 290 states have internal predecessors, (381), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 07:41:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 424 transitions. [2025-03-04 07:41:14,120 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 424 transitions. Word has length 28 [2025-03-04 07:41:14,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:14,120 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 424 transitions. [2025-03-04 07:41:14,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 424 transitions. [2025-03-04 07:41:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:41:14,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:14,121 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:14,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:14,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:41:14,326 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:14,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:14,327 INFO L85 PathProgramCache]: Analyzing trace with hash -783288094, now seen corresponding path program 1 times [2025-03-04 07:41:14,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:14,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397035328] [2025-03-04 07:41:14,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:14,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:14,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:41:14,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:41:14,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:14,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:14,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:14,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397035328] [2025-03-04 07:41:14,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397035328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098210675] [2025-03-04 07:41:14,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:14,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:14,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:14,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:14,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:41:14,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:41:14,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:41:14,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:14,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:14,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 07:41:14,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:14,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:14,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:15,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:15,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098210675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:15,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:15,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2025-03-04 07:41:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660424635] [2025-03-04 07:41:15,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:15,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:41:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:15,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:41:15,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:41:15,172 INFO L87 Difference]: Start difference. First operand 310 states and 424 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:15,512 INFO L93 Difference]: Finished difference Result 319 states and 424 transitions. [2025-03-04 07:41:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:41:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 07:41:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:15,514 INFO L225 Difference]: With dead ends: 319 [2025-03-04 07:41:15,514 INFO L226 Difference]: Without dead ends: 319 [2025-03-04 07:41:15,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:41:15,514 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 271 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:15,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 208 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-04 07:41:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 311. [2025-03-04 07:41:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 273 states have (on average 1.380952380952381) internal successors, (377), 291 states have internal predecessors, (377), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 07:41:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 420 transitions. [2025-03-04 07:41:15,523 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 420 transitions. Word has length 29 [2025-03-04 07:41:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:15,523 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 420 transitions. [2025-03-04 07:41:15,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 420 transitions. [2025-03-04 07:41:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:41:15,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:15,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:15,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:41:15,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 07:41:15,728 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:15,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1487872880, now seen corresponding path program 1 times [2025-03-04 07:41:15,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:15,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762300960] [2025-03-04 07:41:15,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:15,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:15,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:41:15,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:41:15,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:15,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:15,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:15,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762300960] [2025-03-04 07:41:15,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762300960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:15,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056155836] [2025-03-04 07:41:15,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:15,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:15,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:15,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:41:15,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:41:15,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:41:15,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:15,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:15,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:41:15,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:15,975 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:15,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:41:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:16,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056155836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:16,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-03-04 07:41:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518899927] [2025-03-04 07:41:16,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:16,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:41:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:16,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:41:16,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:16,050 INFO L87 Difference]: Start difference. First operand 311 states and 420 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 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-03-04 07:41:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:16,322 INFO L93 Difference]: Finished difference Result 427 states and 535 transitions. [2025-03-04 07:41:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:41:16,323 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 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 30 [2025-03-04 07:41:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:16,324 INFO L225 Difference]: With dead ends: 427 [2025-03-04 07:41:16,324 INFO L226 Difference]: Without dead ends: 427 [2025-03-04 07:41:16,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:41:16,325 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 331 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:16,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 246 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-04 07:41:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 386. [2025-03-04 07:41:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 345 states have (on average 1.3478260869565217) internal successors, (465), 364 states have internal predecessors, (465), 11 states have call successors, (11), 10 states have call predecessors, (11), 18 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 07:41:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 507 transitions. [2025-03-04 07:41:16,334 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 507 transitions. Word has length 30 [2025-03-04 07:41:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:16,335 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 507 transitions. [2025-03-04 07:41:16,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 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-03-04 07:41:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 507 transitions. [2025-03-04 07:41:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:41:16,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:16,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:16,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:16,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:16,536 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:16,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1120580960, now seen corresponding path program 1 times [2025-03-04 07:41:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:16,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356902693] [2025-03-04 07:41:16,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:16,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:41:16,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:41:16,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:16,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:16,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356902693] [2025-03-04 07:41:16,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356902693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:16,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965083027] [2025-03-04 07:41:16,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:16,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:16,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:16,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:41:16,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:41:16,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:41:16,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:41:16,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:16,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:16,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:16,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965083027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:16,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:16,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-03-04 07:41:16,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782495806] [2025-03-04 07:41:16,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:16,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:16,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:16,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:16,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:41:16,980 INFO L87 Difference]: Start difference. First operand 386 states and 507 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:17,391 INFO L93 Difference]: Finished difference Result 518 states and 632 transitions. [2025-03-04 07:41:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:41:17,391 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-04 07:41:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:17,392 INFO L225 Difference]: With dead ends: 518 [2025-03-04 07:41:17,392 INFO L226 Difference]: Without dead ends: 518 [2025-03-04 07:41:17,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:41:17,393 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 264 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:17,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 293 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-04 07:41:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 474. [2025-03-04 07:41:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 430 states have (on average 1.3255813953488371) internal successors, (570), 451 states have internal predecessors, (570), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-04 07:41:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 608 transitions. [2025-03-04 07:41:17,401 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 608 transitions. Word has length 31 [2025-03-04 07:41:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:17,401 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 608 transitions. [2025-03-04 07:41:17,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 608 transitions. [2025-03-04 07:41:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:41:17,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:17,402 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:17,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:41:17,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:17,606 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash 911565490, now seen corresponding path program 1 times [2025-03-04 07:41:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894888085] [2025-03-04 07:41:17,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:17,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:41:17,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:41:17,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:17,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:17,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894888085] [2025-03-04 07:41:17,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894888085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:17,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753884253] [2025-03-04 07:41:17,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:17,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:17,753 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:17,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:41:17,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:41:17,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:41:17,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:41:17,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:18,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:18,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:18,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753884253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:18,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:18,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2025-03-04 07:41:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91317324] [2025-03-04 07:41:18,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:18,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:41:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:18,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:41:18,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:41:18,235 INFO L87 Difference]: Start difference. First operand 474 states and 608 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:18,554 INFO L93 Difference]: Finished difference Result 488 states and 601 transitions. [2025-03-04 07:41:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:41:18,554 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-03-04 07:41:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:18,556 INFO L225 Difference]: With dead ends: 488 [2025-03-04 07:41:18,556 INFO L226 Difference]: Without dead ends: 488 [2025-03-04 07:41:18,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:41:18,556 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 239 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:18,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 181 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:18,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-04 07:41:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 471. [2025-03-04 07:41:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 430 states have (on average 1.2767441860465116) internal successors, (549), 448 states have internal predecessors, (549), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-04 07:41:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 587 transitions. [2025-03-04 07:41:18,564 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 587 transitions. Word has length 35 [2025-03-04 07:41:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:18,564 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 587 transitions. [2025-03-04 07:41:18,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 587 transitions. [2025-03-04 07:41:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:41:18,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:18,564 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:18,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:41:18,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:18,765 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2144387841, now seen corresponding path program 1 times [2025-03-04 07:41:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:18,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383003841] [2025-03-04 07:41:18,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:18,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:41:18,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:41:18,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:18,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:41:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383003841] [2025-03-04 07:41:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383003841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056471660] [2025-03-04 07:41:18,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:18,877 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:18,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:41:18,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:41:18,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:41:18,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:18,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:18,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:41:18,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:19,042 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:41:19,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 07:41:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:41:19,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:19,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 07:41:19,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 07:41:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:41:19,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056471660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:19,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:19,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2025-03-04 07:41:19,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233587305] [2025-03-04 07:41:19,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:19,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:19,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:19,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:19,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:19,282 INFO L87 Difference]: Start difference. First operand 471 states and 587 transitions. Second operand has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:41:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:19,544 INFO L93 Difference]: Finished difference Result 510 states and 613 transitions. [2025-03-04 07:41:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:41:19,545 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2025-03-04 07:41:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:19,546 INFO L225 Difference]: With dead ends: 510 [2025-03-04 07:41:19,546 INFO L226 Difference]: Without dead ends: 510 [2025-03-04 07:41:19,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:41:19,547 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 163 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:19,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 208 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-04 07:41:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 474. [2025-03-04 07:41:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 433 states have (on average 1.2748267898383372) internal successors, (552), 451 states have internal predecessors, (552), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-04 07:41:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 589 transitions. [2025-03-04 07:41:19,556 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 589 transitions. Word has length 36 [2025-03-04 07:41:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:19,557 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 589 transitions. [2025-03-04 07:41:19,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:41:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 589 transitions. [2025-03-04 07:41:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:41:19,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:19,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:19,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:19,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 07:41:19,758 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:19,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2051513653, now seen corresponding path program 1 times [2025-03-04 07:41:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226035187] [2025-03-04 07:41:19,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:19,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:41:19,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:41:19,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:19,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:20,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:20,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226035187] [2025-03-04 07:41:20,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226035187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:20,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401940250] [2025-03-04 07:41:20,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:20,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:20,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:20,090 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:20,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:41:20,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:41:20,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:41:20,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:20,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:20,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:20,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:20,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:20,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401940250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:20,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:20,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2025-03-04 07:41:20,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075669994] [2025-03-04 07:41:20,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:20,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:41:20,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:20,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:41:20,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:41:20,641 INFO L87 Difference]: Start difference. First operand 474 states and 589 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:41:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:21,843 INFO L93 Difference]: Finished difference Result 682 states and 817 transitions. [2025-03-04 07:41:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 07:41:21,843 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-03-04 07:41:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:21,845 INFO L225 Difference]: With dead ends: 682 [2025-03-04 07:41:21,845 INFO L226 Difference]: Without dead ends: 682 [2025-03-04 07:41:21,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=615, Invalid=3045, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 07:41:21,847 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 908 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:21,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 459 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:41:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-04 07:41:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 478. [2025-03-04 07:41:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 439 states have (on average 1.2642369020501139) internal successors, (555), 457 states have internal predecessors, (555), 10 states have call successors, (10), 10 states have call predecessors, (10), 20 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2025-03-04 07:41:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 589 transitions. [2025-03-04 07:41:21,856 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 589 transitions. Word has length 37 [2025-03-04 07:41:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:21,857 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 589 transitions. [2025-03-04 07:41:21,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:41:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 589 transitions. [2025-03-04 07:41:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:41:21,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:21,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:21,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:41:22,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 07:41:22,059 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:22,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash -695180164, now seen corresponding path program 1 times [2025-03-04 07:41:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819694983] [2025-03-04 07:41:22,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:22,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:41:22,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:41:22,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:41:22,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:22,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819694983] [2025-03-04 07:41:22,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819694983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:22,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359553035] [2025-03-04 07:41:22,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:22,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:22,105 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:22,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:41:22,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:41:22,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:41:22,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:22,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:41:22,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:22,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359553035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:22,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:41:22,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-04 07:41:22,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945620451] [2025-03-04 07:41:22,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:22,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:22,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:22,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:22,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:22,184 INFO L87 Difference]: Start difference. First operand 478 states and 589 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:22,201 INFO L93 Difference]: Finished difference Result 285 states and 334 transitions. [2025-03-04 07:41:22,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:22,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-04 07:41:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:22,202 INFO L225 Difference]: With dead ends: 285 [2025-03-04 07:41:22,202 INFO L226 Difference]: Without dead ends: 285 [2025-03-04 07:41:22,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:22,203 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:22,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 103 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-04 07:41:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2025-03-04 07:41:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 253 states have (on average 1.233201581027668) internal successors, (312), 266 states have internal predecessors, (312), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 07:41:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 332 transitions. [2025-03-04 07:41:22,207 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 332 transitions. Word has length 45 [2025-03-04 07:41:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:22,208 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 332 transitions. [2025-03-04 07:41:22,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 332 transitions. [2025-03-04 07:41:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:41:22,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:22,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:22,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:22,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 07:41:22,413 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:22,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash 811881308, now seen corresponding path program 1 times [2025-03-04 07:41:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459623887] [2025-03-04 07:41:22,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:22,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:41:22,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:41:22,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:41:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:22,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459623887] [2025-03-04 07:41:22,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459623887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:22,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:22,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21422590] [2025-03-04 07:41:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:22,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:22,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:22,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:22,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:22,461 INFO L87 Difference]: Start difference. First operand 281 states and 332 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:22,474 INFO L93 Difference]: Finished difference Result 280 states and 329 transitions. [2025-03-04 07:41:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:22,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 07:41:22,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:22,476 INFO L225 Difference]: With dead ends: 280 [2025-03-04 07:41:22,476 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 07:41:22,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:22,476 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:22,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 80 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 07:41:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-04 07:41:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 253 states have (on average 1.2213438735177866) internal successors, (309), 265 states have internal predecessors, (309), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 07:41:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 329 transitions. [2025-03-04 07:41:22,482 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 329 transitions. Word has length 47 [2025-03-04 07:41:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:22,483 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 329 transitions. [2025-03-04 07:41:22,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 329 transitions. [2025-03-04 07:41:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:41:22,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:22,483 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:22,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 07:41:22,484 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:22,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:22,484 INFO L85 PathProgramCache]: Analyzing trace with hash -601483238, now seen corresponding path program 1 times [2025-03-04 07:41:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:22,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636590962] [2025-03-04 07:41:22,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:22,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:41:22,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:41:22,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:41:22,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:22,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636590962] [2025-03-04 07:41:22,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636590962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:22,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:22,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126821040] [2025-03-04 07:41:22,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:22,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:22,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:22,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:22,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:22,536 INFO L87 Difference]: Start difference. First operand 280 states and 329 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:22,575 INFO L93 Difference]: Finished difference Result 279 states and 325 transitions. [2025-03-04 07:41:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:22,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-04 07:41:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:22,576 INFO L225 Difference]: With dead ends: 279 [2025-03-04 07:41:22,576 INFO L226 Difference]: Without dead ends: 279 [2025-03-04 07:41:22,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:22,576 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:22,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 66 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-04 07:41:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-04 07:41:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.2055335968379446) internal successors, (305), 264 states have internal predecessors, (305), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 07:41:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 325 transitions. [2025-03-04 07:41:22,582 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 325 transitions. Word has length 48 [2025-03-04 07:41:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:22,582 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 325 transitions. [2025-03-04 07:41:22,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 325 transitions. [2025-03-04 07:41:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:41:22,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:22,583 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:22,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 07:41:22,583 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr6ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:22,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:22,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1466111206, now seen corresponding path program 1 times [2025-03-04 07:41:22,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:22,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579268584] [2025-03-04 07:41:22,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:22,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 07:41:22,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:41:22,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:41:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:22,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579268584] [2025-03-04 07:41:22,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579268584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:22,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:22,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530003828] [2025-03-04 07:41:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:22,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:22,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:22,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:22,641 INFO L87 Difference]: Start difference. First operand 279 states and 325 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:22,689 INFO L93 Difference]: Finished difference Result 293 states and 333 transitions. [2025-03-04 07:41:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 07:41:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:22,691 INFO L225 Difference]: With dead ends: 293 [2025-03-04 07:41:22,691 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 07:41:22,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:22,691 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:22,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 07:41:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2025-03-04 07:41:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.1936758893280632) internal successors, (302), 264 states have internal predecessors, (302), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 07:41:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2025-03-04 07:41:22,697 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 49 [2025-03-04 07:41:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:22,697 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2025-03-04 07:41:22,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2025-03-04 07:41:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:41:22,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:22,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:22,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 07:41:22,697 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:22,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:22,698 INFO L85 PathProgramCache]: Analyzing trace with hash 699214149, now seen corresponding path program 1 times [2025-03-04 07:41:22,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:22,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325593246] [2025-03-04 07:41:22,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:22,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:22,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:22,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:22,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:22,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325593246] [2025-03-04 07:41:22,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325593246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:22,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625684192] [2025-03-04 07:41:22,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:22,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:22,846 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:22,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:41:22,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:22,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:22,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:41:22,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:22,969 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:22,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:41:22,987 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| 1))) is different from true [2025-03-04 07:41:23,003 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:41:23,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:41:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 7 not checked. [2025-03-04 07:41:23,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625684192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:23,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:23,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2025-03-04 07:41:23,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417374254] [2025-03-04 07:41:23,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:23,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:23,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:23,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=184, Unknown=1, NotChecked=28, Total=272 [2025-03-04 07:41:23,161 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:41:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:23,508 INFO L93 Difference]: Finished difference Result 310 states and 348 transitions. [2025-03-04 07:41:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:41:23,509 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2025-03-04 07:41:23,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:23,510 INFO L225 Difference]: With dead ends: 310 [2025-03-04 07:41:23,510 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 07:41:23,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=760, Unknown=1, NotChecked=62, Total=1122 [2025-03-04 07:41:23,510 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 247 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:23,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 257 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 264 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2025-03-04 07:41:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 07:41:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 279. [2025-03-04 07:41:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.1818181818181819) internal successors, (299), 264 states have internal predecessors, (299), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 07:41:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 319 transitions. [2025-03-04 07:41:23,515 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 319 transitions. Word has length 51 [2025-03-04 07:41:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:23,515 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 319 transitions. [2025-03-04 07:41:23,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:41:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 319 transitions. [2025-03-04 07:41:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:41:23,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:23,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:23,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:41:23,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:41:23,718 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:23,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash 200802155, now seen corresponding path program 1 times [2025-03-04 07:41:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:23,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329662908] [2025-03-04 07:41:23,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:23,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:23,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:23,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:41:23,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:23,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:23,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329662908] [2025-03-04 07:41:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329662908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678781192] [2025-03-04 07:41:23,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:23,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:23,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:23,931 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:23,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:41:23,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:24,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:41:24,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:24,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:41:24,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:24,125 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:24,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:41:24,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:24,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:24,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 07:41:24,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678781192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:24,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2025-03-04 07:41:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989026003] [2025-03-04 07:41:24,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:24,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:41:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:24,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:41:24,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:41:24,378 INFO L87 Difference]: Start difference. First operand 279 states and 319 transitions. Second operand has 20 states, 16 states have (on average 5.125) internal successors, (82), 14 states have internal predecessors, (82), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:41:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:24,764 INFO L93 Difference]: Finished difference Result 293 states and 324 transitions. [2025-03-04 07:41:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:41:24,765 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 5.125) internal successors, (82), 14 states have internal predecessors, (82), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2025-03-04 07:41:24,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:24,766 INFO L225 Difference]: With dead ends: 293 [2025-03-04 07:41:24,766 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 07:41:24,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:41:24,766 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 272 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:24,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 298 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:24,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 07:41:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 278. [2025-03-04 07:41:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 253 states have (on average 1.150197628458498) internal successors, (291), 263 states have internal predecessors, (291), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 07:41:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 311 transitions. [2025-03-04 07:41:24,770 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 311 transitions. Word has length 52 [2025-03-04 07:41:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:24,770 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 311 transitions. [2025-03-04 07:41:24,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 5.125) internal successors, (82), 14 states have internal predecessors, (82), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:41:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 311 transitions. [2025-03-04 07:41:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:41:24,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:24,771 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:24,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:41:24,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:24,975 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:24,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash 190136151, now seen corresponding path program 1 times [2025-03-04 07:41:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334353602] [2025-03-04 07:41:24,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:24,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:41:24,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:41:24,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:41:25,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334353602] [2025-03-04 07:41:25,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334353602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004853802] [2025-03-04 07:41:25,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:25,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:25,088 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:25,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:41:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:41:25,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:41:25,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 07:41:25,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:25,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:41:25,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:41:25,327 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:41:25,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 07:41:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:41:25,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:25,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 07:41:25,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 07:41:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:41:25,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004853802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:25,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:25,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 22 [2025-03-04 07:41:25,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390482793] [2025-03-04 07:41:25,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:25,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:41:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:25,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:41:25,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:41:25,578 INFO L87 Difference]: Start difference. First operand 278 states and 311 transitions. Second operand has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 22 states have internal predecessors, (141), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:41:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:25,716 INFO L93 Difference]: Finished difference Result 288 states and 321 transitions. [2025-03-04 07:41:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:25,717 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 22 states have internal predecessors, (141), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2025-03-04 07:41:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:25,717 INFO L225 Difference]: With dead ends: 288 [2025-03-04 07:41:25,717 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 07:41:25,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:41:25,718 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 193 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:25,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 114 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 07:41:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 277. [2025-03-04 07:41:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 253 states have (on average 1.1462450592885376) internal successors, (290), 262 states have internal predecessors, (290), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 07:41:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 310 transitions. [2025-03-04 07:41:25,722 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 310 transitions. Word has length 57 [2025-03-04 07:41:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:25,723 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 310 transitions. [2025-03-04 07:41:25,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 22 states have internal predecessors, (141), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:41:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 310 transitions. [2025-03-04 07:41:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 07:41:25,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:25,723 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:25,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:25,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 07:41:25,924 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:25,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2147209798, now seen corresponding path program 1 times [2025-03-04 07:41:25,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:25,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756645557] [2025-03-04 07:41:25,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:25,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:41:25,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:41:25,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:26,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:26,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756645557] [2025-03-04 07:41:26,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756645557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:26,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207873813] [2025-03-04 07:41:26,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:26,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:26,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:26,287 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:26,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:41:26,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:41:26,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:41:26,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:26,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:26,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 07:41:26,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:26,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:26,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:26,707 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:26,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:41:27,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:27,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:27,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:41:27,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:41:27,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:41:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:41:27,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:27,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207873813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:27,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:27,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 24 [2025-03-04 07:41:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162182991] [2025-03-04 07:41:27,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:27,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:41:27,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:27,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:41:27,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:41:27,435 INFO L87 Difference]: Start difference. First operand 277 states and 310 transitions. Second operand has 26 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:41:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:28,271 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2025-03-04 07:41:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:41:28,272 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2025-03-04 07:41:28,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:28,273 INFO L225 Difference]: With dead ends: 301 [2025-03-04 07:41:28,273 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 07:41:28,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=460, Invalid=2090, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 07:41:28,274 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 307 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:28,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 278 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 07:41:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 237. [2025-03-04 07:41:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 218 states have (on average 1.1422018348623852) internal successors, (249), 224 states have internal predecessors, (249), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 07:41:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 264 transitions. [2025-03-04 07:41:28,278 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 264 transitions. Word has length 58 [2025-03-04 07:41:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:28,278 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 264 transitions. [2025-03-04 07:41:28,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:41:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 264 transitions. [2025-03-04 07:41:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 07:41:28,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:28,283 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:28,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:41:28,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:28,487 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:28,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1599253407, now seen corresponding path program 1 times [2025-03-04 07:41:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131928702] [2025-03-04 07:41:28,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:28,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:41:28,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:41:28,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:28,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:28,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:28,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131928702] [2025-03-04 07:41:28,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131928702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842223284] [2025-03-04 07:41:28,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:28,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:28,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:28,950 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:28,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:41:28,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:41:29,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:41:29,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:29,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:29,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:41:29,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:29,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:41:29,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:41:29,388 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:41:29,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 07:41:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:41:29,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:29,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-03-04 07:41:29,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:41:29,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2025-03-04 07:41:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:41:29,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842223284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:29,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:29,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 13] total 44 [2025-03-04 07:41:29,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881514630] [2025-03-04 07:41:29,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:29,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 07:41:29,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:29,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 07:41:29,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1778, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 07:41:29,839 INFO L87 Difference]: Start difference. First operand 237 states and 264 transitions. Second operand has 45 states, 41 states have (on average 3.707317073170732) internal successors, (152), 36 states have internal predecessors, (152), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:41:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:30,224 INFO L93 Difference]: Finished difference Result 251 states and 277 transitions. [2025-03-04 07:41:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:41:30,225 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 3.707317073170732) internal successors, (152), 36 states have internal predecessors, (152), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2025-03-04 07:41:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:30,226 INFO L225 Difference]: With dead ends: 251 [2025-03-04 07:41:30,226 INFO L226 Difference]: Without dead ends: 251 [2025-03-04 07:41:30,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=430, Invalid=2326, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 07:41:30,227 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 250 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:30,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 241 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-04 07:41:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 237. [2025-03-04 07:41:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 218 states have (on average 1.1376146788990826) internal successors, (248), 224 states have internal predecessors, (248), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 07:41:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 263 transitions. [2025-03-04 07:41:30,233 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 263 transitions. Word has length 58 [2025-03-04 07:41:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:30,233 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 263 transitions. [2025-03-04 07:41:30,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 3.707317073170732) internal successors, (152), 36 states have internal predecessors, (152), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:41:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 263 transitions. [2025-03-04 07:41:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 07:41:30,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:30,234 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:30,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:30,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:30,439 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:30,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash -715767203, now seen corresponding path program 1 times [2025-03-04 07:41:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:30,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441752669] [2025-03-04 07:41:30,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:30,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:41:30,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:41:30,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:30,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:41:30,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:30,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441752669] [2025-03-04 07:41:30,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441752669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:30,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443184713] [2025-03-04 07:41:30,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:30,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:30,634 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:30,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 07:41:30,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:41:30,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:41:30,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:30,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:30,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:41:30,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:30,762 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:30,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:41:30,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:41:30,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:31,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443184713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:31,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:31,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-04 07:41:31,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709704193] [2025-03-04 07:41:31,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:31,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:41:31,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:31,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:41:31,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:41:31,081 INFO L87 Difference]: Start difference. First operand 237 states and 263 transitions. Second operand has 17 states, 15 states have (on average 5.6) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:41:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:31,275 INFO L93 Difference]: Finished difference Result 250 states and 276 transitions. [2025-03-04 07:41:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:41:31,275 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.6) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2025-03-04 07:41:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:31,276 INFO L225 Difference]: With dead ends: 250 [2025-03-04 07:41:31,276 INFO L226 Difference]: Without dead ends: 250 [2025-03-04 07:41:31,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:41:31,277 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 233 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:31,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 172 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-04 07:41:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2025-03-04 07:41:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 218 states have (on average 1.1330275229357798) internal successors, (247), 223 states have internal predecessors, (247), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 07:41:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 262 transitions. [2025-03-04 07:41:31,284 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 262 transitions. Word has length 60 [2025-03-04 07:41:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:31,284 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 262 transitions. [2025-03-04 07:41:31,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.6) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:41:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 262 transitions. [2025-03-04 07:41:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:41:31,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:31,285 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:31,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:31,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:31,489 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:31,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:31,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1412141902, now seen corresponding path program 2 times [2025-03-04 07:41:31,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:31,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152297155] [2025-03-04 07:41:31,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:31,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-03-04 07:41:31,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:41:31,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:31,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:41:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152297155] [2025-03-04 07:41:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152297155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023020190] [2025-03-04 07:41:32,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:32,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:32,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:32,013 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:32,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 07:41:32,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-03-04 07:41:32,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:41:32,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:32,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:32,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:41:32,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:32,207 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:41:32,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:41:32,421 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:41:32,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 07:41:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:32,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:32,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-03-04 07:41:32,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:41:32,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2025-03-04 07:41:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:33,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023020190] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:33,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 44 [2025-03-04 07:41:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317301243] [2025-03-04 07:41:33,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:33,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 07:41:33,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:33,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 07:41:33,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1878, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 07:41:33,102 INFO L87 Difference]: Start difference. First operand 236 states and 262 transitions. Second operand has 46 states, 42 states have (on average 4.238095238095238) internal successors, (178), 38 states have internal predecessors, (178), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:41:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:33,708 INFO L93 Difference]: Finished difference Result 249 states and 275 transitions. [2025-03-04 07:41:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:41:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 4.238095238095238) internal successors, (178), 38 states have internal predecessors, (178), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2025-03-04 07:41:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:33,709 INFO L225 Difference]: With dead ends: 249 [2025-03-04 07:41:33,709 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 07:41:33,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=518, Invalid=2788, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 07:41:33,710 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 349 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:33,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 246 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 07:41:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 235. [2025-03-04 07:41:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 218 states have (on average 1.128440366972477) internal successors, (246), 222 states have internal predecessors, (246), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 07:41:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 261 transitions. [2025-03-04 07:41:33,715 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 261 transitions. Word has length 66 [2025-03-04 07:41:33,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:33,715 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 261 transitions. [2025-03-04 07:41:33,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 4.238095238095238) internal successors, (178), 38 states have internal predecessors, (178), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:41:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 261 transitions. [2025-03-04 07:41:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 07:41:33,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:33,716 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:33,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 07:41:33,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:33,917 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:33,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash 143658510, now seen corresponding path program 1 times [2025-03-04 07:41:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:33,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146464766] [2025-03-04 07:41:33,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:33,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 07:41:33,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 07:41:33,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:33,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:41:33,937 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:41:33,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 07:41:33,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 07:41:33,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:33,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:41:33,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:41:33,987 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:41:33,987 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-03-04 07:41:33,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE (18 of 20 remaining) [2025-03-04 07:41:33,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE (17 of 20 remaining) [2025-03-04 07:41:33,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (16 of 20 remaining) [2025-03-04 07:41:33,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_FREE (15 of 20 remaining) [2025-03-04 07:41:33,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_FREE (14 of 20 remaining) [2025-03-04 07:41:33,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE (13 of 20 remaining) [2025-03-04 07:41:33,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6ASSERT_VIOLATIONMEMORY_FREE (12 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE (11 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE (10 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 20 remaining) [2025-03-04 07:41:33,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 20 remaining) [2025-03-04 07:41:33,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 07:41:33,995 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:34,035 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:41:34,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:41:34 BoogieIcfgContainer [2025-03-04 07:41:34,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:41:34,042 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:41:34,042 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:41:34,042 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:41:34,046 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:07" (3/4) ... [2025-03-04 07:41:34,047 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:41:34,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:41:34,048 INFO L158 Benchmark]: Toolchain (without parser) took 27107.11ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 121.6MB in the beginning and 194.6MB in the end (delta: -72.9MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2025-03-04 07:41:34,048 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:34,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.61ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 101.5MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:34,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.02ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 99.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:41:34,049 INFO L158 Benchmark]: Boogie Preprocessor took 43.84ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 97.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:34,049 INFO L158 Benchmark]: IcfgBuilder took 338.78ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 81.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:34,049 INFO L158 Benchmark]: TraceAbstraction took 26293.63ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 80.5MB in the beginning and 194.7MB in the end (delta: -114.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2025-03-04 07:41:34,049 INFO L158 Benchmark]: Witness Printer took 5.80ms. Allocated memory is still 293.6MB. Free memory was 194.7MB in the beginning and 194.6MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:34,050 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.26ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.61ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 101.5MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.02ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 99.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.84ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 97.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 338.78ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 81.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26293.63ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 80.5MB in the beginning and 194.7MB in the end (delta: -114.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Witness Printer took 5.80ms. Allocated memory is still 293.6MB. Free memory was 194.7MB in the beginning and 194.6MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, input={3:0}, state=0] [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={-3:0}, state=1] [L695] RET commands[i].function() [L722] RET parse_input("c1") VAL [commands={6:0}, global={-3:0}, state=1] [L723] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, input={4:0}, state=1] [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L706] COND TRUE \read(*global) VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, input={5:0}, state=1] [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L706] COND TRUE \read(*global) VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=1, commands={6:0}, global={-6:0}, state=1] [L695] RET commands[i].function() [L724] RET parse_input("c2") VAL [commands={6:0}, global={-6:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={-6:0}, state=1] - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 26.2s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5870 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5870 mSDsluCounter, 6760 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 126 IncrementalHoareTripleChecker+Unchecked, 5264 mSDsCounter, 735 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6872 IncrementalHoareTripleChecker+Invalid, 7733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 735 mSolverCounterUnsat, 1496 mSDtfsCounter, 6872 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1579 GetRequests, 990 SyntacticMatches, 4 SemanticMatches, 585 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4409 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=478occurred in iteration=22, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 931 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 1854 NumberOfCodeBlocks, 1854 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 2026 ConstructedInterpolants, 163 QuantifiedInterpolants, 28717 SizeOfPredicates, 79 NumberOfNonLiveVariables, 4709 ConjunctsInSsa, 387 ConjunctsInUnsatCore, 60 InterpolantComputations, 16 PerfectInterpolantSequences, 312/1091 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 07:41:34,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:41:35,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:35,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:41:35,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:35,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:35,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:35,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:35,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:35,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:35,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:35,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:35,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:35,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:35,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:35,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:35,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:35,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:35,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2025-03-04 07:41:36,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:36,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:36,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:36,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:36,233 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:36,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2025-03-04 07:41:37,395 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fcc55f14/7e9fbe6ef3dd4c2abecb96a78af2c6bd/FLAG6c6985345 [2025-03-04 07:41:37,628 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:37,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2025-03-04 07:41:37,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fcc55f14/7e9fbe6ef3dd4c2abecb96a78af2c6bd/FLAG6c6985345 [2025-03-04 07:41:37,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fcc55f14/7e9fbe6ef3dd4c2abecb96a78af2c6bd [2025-03-04 07:41:37,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:37,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:37,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:37,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:37,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:37,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:37" (1/1) ... [2025-03-04 07:41:37,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604c0198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:37, skipping insertion in model container [2025-03-04 07:41:37,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:37" (1/1) ... [2025-03-04 07:41:37,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:38,193 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:38,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:38,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:41:38,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:38,274 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:41:38,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38 WrapperNode [2025-03-04 07:41:38,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:38,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:38,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:41:38,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:41:38,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,314 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 93 [2025-03-04 07:41:38,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:38,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:41:38,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:41:38,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:41:38,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,345 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 9, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 07:41:38,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:41:38,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:41:38,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:41:38,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:41:38,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:38,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:41:38,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:41:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 07:41:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 07:41:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 07:41:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-03-04 07:41:38,433 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-03-04 07:41:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:41:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:41:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:41:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:41:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:41:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:41:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:41:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:41:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:41:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:41:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:41:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 07:41:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:41:38,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:41:38,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:41:38,545 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:41:38,762 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-04 07:41:38,762 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:41:38,768 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:41:38,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:41:38,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:38 BoogieIcfgContainer [2025-03-04 07:41:38,769 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:41:38,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:41:38,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:41:38,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:41:38,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:41:37" (1/3) ... [2025-03-04 07:41:38,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36097195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:38, skipping insertion in model container [2025-03-04 07:41:38,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38" (2/3) ... [2025-03-04 07:41:38,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36097195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:38, skipping insertion in model container [2025-03-04 07:41:38,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:38" (3/3) ... [2025-03-04 07:41:38,775 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2025-03-04 07:41:38,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:38,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_3.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-03-04 07:41:38,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:38,816 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;@2ec10870, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:38,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 07:41:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 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-03-04 07:41:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:38,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:38,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:38,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:38,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1396543346, now seen corresponding path program 1 times [2025-03-04 07:41:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:38,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625307844] [2025-03-04 07:41:38,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:38,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:38,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:38,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:38,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:41:38,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:38,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:38,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:38,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:38,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:38,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:39,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:39,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625307844] [2025-03-04 07:41:39,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625307844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:39,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:39,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:39,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555174658] [2025-03-04 07:41:39,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:39,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:39,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:39,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:39,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:39,078 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 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 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:39,213 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2025-03-04 07:41:39,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:39,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:39,219 INFO L225 Difference]: With dead ends: 109 [2025-03-04 07:41:39,219 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 07:41:39,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:39,222 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 51 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:39,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 101 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 07:41:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2025-03-04 07:41:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.709090909090909) internal successors, (94), 74 states have internal predecessors, (94), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 07:41:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2025-03-04 07:41:39,260 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 6 [2025-03-04 07:41:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:39,260 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2025-03-04 07:41:39,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2025-03-04 07:41:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:39,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:39,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:39,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:41:39,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:39,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:39,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1396543345, now seen corresponding path program 1 times [2025-03-04 07:41:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:39,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852983129] [2025-03-04 07:41:39,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:39,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:39,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:39,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:39,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:41:39,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:39,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:39,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:39,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:39,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:41:39,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:39,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:39,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852983129] [2025-03-04 07:41:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852983129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:39,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822616102] [2025-03-04 07:41:39,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:39,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:39,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:39,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:39,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:39,592 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:39,712 INFO L93 Difference]: Finished difference Result 180 states and 236 transitions. [2025-03-04 07:41:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:39,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:39,714 INFO L225 Difference]: With dead ends: 180 [2025-03-04 07:41:39,715 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 07:41:39,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:39,716 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 92 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:39,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 141 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 07:41:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149. [2025-03-04 07:41:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 117 states have (on average 1.7606837606837606) internal successors, (206), 136 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 07:41:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2025-03-04 07:41:39,738 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 6 [2025-03-04 07:41:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:39,739 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2025-03-04 07:41:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2025-03-04 07:41:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:41:39,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:39,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:39,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:41:39,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:39,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:39,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash -343170744, now seen corresponding path program 1 times [2025-03-04 07:41:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1267642796] [2025-03-04 07:41:39,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:39,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:39,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:39,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:39,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:41:39,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:41:39,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:41:39,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:39,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:39,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:39,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:40,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:40,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267642796] [2025-03-04 07:41:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267642796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803376965] [2025-03-04 07:41:40,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:40,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:40,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:40,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:40,112 INFO L87 Difference]: Start difference. First operand 149 states and 232 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-03-04 07:41:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:40,284 INFO L93 Difference]: Finished difference Result 194 states and 281 transitions. [2025-03-04 07:41:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:40,284 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-03-04 07:41:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:40,286 INFO L225 Difference]: With dead ends: 194 [2025-03-04 07:41:40,286 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 07:41:40,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03-04 07:41:40,287 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 79 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:40,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 160 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 07:41:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 152. [2025-03-04 07:41:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.7416666666666667) internal successors, (209), 139 states have internal predecessors, (209), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 07:41:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 235 transitions. [2025-03-04 07:41:40,301 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 235 transitions. Word has length 7 [2025-03-04 07:41:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:40,301 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 235 transitions. [2025-03-04 07:41:40,302 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-03-04 07:41:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions. [2025-03-04 07:41:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:41:40,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:40,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:40,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:40,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:40,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:40,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2048358452, now seen corresponding path program 1 times [2025-03-04 07:41:40,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:40,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203138397] [2025-03-04 07:41:40,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:40,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:40,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:40,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:40,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:41:40,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:41:40,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:41:40,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:40,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:40,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:41:40,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:40,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:40,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:40,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203138397] [2025-03-04 07:41:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203138397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:40,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:40,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158975583] [2025-03-04 07:41:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:40,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:40,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:40,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:40,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:40,705 INFO L87 Difference]: Start difference. First operand 152 states and 235 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-03-04 07:41:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:40,876 INFO L93 Difference]: Finished difference Result 182 states and 237 transitions. [2025-03-04 07:41:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:40,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-03-04 07:41:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:40,878 INFO L225 Difference]: With dead ends: 182 [2025-03-04 07:41:40,878 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 07:41:40,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-03-04 07:41:40,878 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 74 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:40,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 201 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 07:41:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2025-03-04 07:41:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.725) internal successors, (207), 139 states have internal predecessors, (207), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 07:41:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 233 transitions. [2025-03-04 07:41:40,895 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 233 transitions. Word has length 8 [2025-03-04 07:41:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:40,895 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 233 transitions. [2025-03-04 07:41:40,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-03-04 07:41:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 233 transitions. [2025-03-04 07:41:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:41:40,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:40,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:40,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:41,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:41,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:41,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash 925397446, now seen corresponding path program 1 times [2025-03-04 07:41:41,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:41,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311482813] [2025-03-04 07:41:41,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:41,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:41,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:41:41,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:41,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:41:41,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:41,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:41,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:41:41,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:41,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:41,199 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:41,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311482813] [2025-03-04 07:41:41,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311482813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:41,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443794670] [2025-03-04 07:41:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:41,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:41,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:41,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:41,200 INFO L87 Difference]: Start difference. First operand 152 states and 233 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-03-04 07:41:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:41,302 INFO L93 Difference]: Finished difference Result 234 states and 323 transitions. [2025-03-04 07:41:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:41,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-03-04 07:41:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:41,304 INFO L225 Difference]: With dead ends: 234 [2025-03-04 07:41:41,304 INFO L226 Difference]: Without dead ends: 234 [2025-03-04 07:41:41,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-03-04 07:41:41,305 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 130 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:41,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 186 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-04 07:41:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 185. [2025-03-04 07:41:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 171 states have internal predecessors, (253), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 07:41:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 279 transitions. [2025-03-04 07:41:41,313 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 279 transitions. Word has length 9 [2025-03-04 07:41:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:41,313 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 279 transitions. [2025-03-04 07:41:41,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-03-04 07:41:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 279 transitions. [2025-03-04 07:41:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:41,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:41,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:41,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:41:41,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:41,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:41,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1377450230, now seen corresponding path program 1 times [2025-03-04 07:41:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:41,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757336004] [2025-03-04 07:41:41,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:41,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:41,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:41,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:41:41,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:41,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:41,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:41,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:41,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:41,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:41,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:41,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:41,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757336004] [2025-03-04 07:41:41,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757336004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:41,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:41,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622427536] [2025-03-04 07:41:41,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:41,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:41,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:41,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:41,643 INFO L87 Difference]: Start difference. First operand 185 states and 279 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:41,781 INFO L93 Difference]: Finished difference Result 235 states and 302 transitions. [2025-03-04 07:41:41,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:41,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2025-03-04 07:41:41,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:41,782 INFO L225 Difference]: With dead ends: 235 [2025-03-04 07:41:41,782 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 07:41:41,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-03-04 07:41:41,783 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:41,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 204 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 07:41:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 199. [2025-03-04 07:41:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 164 states have (on average 1.670731707317073) internal successors, (274), 185 states have internal predecessors, (274), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 07:41:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 300 transitions. [2025-03-04 07:41:41,801 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 300 transitions. Word has length 10 [2025-03-04 07:41:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:41,801 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 300 transitions. [2025-03-04 07:41:41,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 300 transitions. [2025-03-04 07:41:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:41:41,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:41,801 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:41,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:41:42,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:42,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:42,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash 675125788, now seen corresponding path program 1 times [2025-03-04 07:41:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:42,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229336687] [2025-03-04 07:41:42,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:42,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:42,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:42,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:42,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:41:42,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:42,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:41:42,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:42,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:42,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:42,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:42,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:42,343 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:42,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229336687] [2025-03-04 07:41:42,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229336687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:42,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:42,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-04 07:41:42,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692627334] [2025-03-04 07:41:42,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:42,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:41:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:42,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:41:42,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:42,344 INFO L87 Difference]: Start difference. First operand 199 states and 300 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:42,645 INFO L93 Difference]: Finished difference Result 270 states and 357 transitions. [2025-03-04 07:41:42,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:42,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 07:41:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:42,647 INFO L225 Difference]: With dead ends: 270 [2025-03-04 07:41:42,647 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 07:41:42,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:41:42,648 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 114 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:42,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 363 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 07:41:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 229. [2025-03-04 07:41:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 194 states have (on average 1.6597938144329898) internal successors, (322), 215 states have internal predecessors, (322), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 07:41:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 348 transitions. [2025-03-04 07:41:42,655 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 348 transitions. Word has length 14 [2025-03-04 07:41:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:42,655 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 348 transitions. [2025-03-04 07:41:42,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 348 transitions. [2025-03-04 07:41:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:41:42,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:42,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:42,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:42,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:42,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:42,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:42,861 INFO L85 PathProgramCache]: Analyzing trace with hash -545937061, now seen corresponding path program 1 times [2025-03-04 07:41:42,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802217342] [2025-03-04 07:41:42,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:42,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:42,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:42,863 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:42,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:41:42,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:42,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:42,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:42,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:42,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:42,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:43,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:43,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:43,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802217342] [2025-03-04 07:41:43,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802217342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:43,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:43,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-04 07:41:43,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866007501] [2025-03-04 07:41:43,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:43,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:41:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:43,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:41:43,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:43,406 INFO L87 Difference]: Start difference. First operand 229 states and 348 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:44,503 INFO L93 Difference]: Finished difference Result 359 states and 493 transitions. [2025-03-04 07:41:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:41:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:41:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:44,505 INFO L225 Difference]: With dead ends: 359 [2025-03-04 07:41:44,505 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 07:41:44,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:41:44,506 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 371 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:44,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 239 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:41:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 07:41:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 267. [2025-03-04 07:41:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 232 states have (on average 1.6551724137931034) internal successors, (384), 253 states have internal predecessors, (384), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 07:41:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 410 transitions. [2025-03-04 07:41:44,513 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 410 transitions. Word has length 15 [2025-03-04 07:41:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:44,513 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 410 transitions. [2025-03-04 07:41:44,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 410 transitions. [2025-03-04 07:41:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:41:44,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:44,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:44,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:41:44,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:44,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash 255820313, now seen corresponding path program 1 times [2025-03-04 07:41:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991287888] [2025-03-04 07:41:44,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:44,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:44,717 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:44,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:41:44,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:41:44,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:41:44,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:44,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:44,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:44,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:45,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:45,327 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:45,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991287888] [2025-03-04 07:41:45,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991287888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:45,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:45,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-04 07:41:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102675082] [2025-03-04 07:41:45,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:45,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:41:45,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:45,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:41:45,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:45,328 INFO L87 Difference]: Start difference. First operand 267 states and 410 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:46,401 INFO L93 Difference]: Finished difference Result 473 states and 643 transitions. [2025-03-04 07:41:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:41:46,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:41:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:46,404 INFO L225 Difference]: With dead ends: 473 [2025-03-04 07:41:46,404 INFO L226 Difference]: Without dead ends: 473 [2025-03-04 07:41:46,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:41:46,404 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 337 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:46,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 429 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:41:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-04 07:41:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 352. [2025-03-04 07:41:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 314 states have (on average 1.6687898089171975) internal successors, (524), 336 states have internal predecessors, (524), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2025-03-04 07:41:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 556 transitions. [2025-03-04 07:41:46,414 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 556 transitions. Word has length 16 [2025-03-04 07:41:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:46,414 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 556 transitions. [2025-03-04 07:41:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 556 transitions. [2025-03-04 07:41:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:46,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:46,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:46,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:41:46,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:46,616 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash -104694343, now seen corresponding path program 1 times [2025-03-04 07:41:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:46,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822663587] [2025-03-04 07:41:46,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:46,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:46,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:46,620 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:46,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:41:46,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:46,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:46,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:46,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:46,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:46,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:46,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:46,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822663587] [2025-03-04 07:41:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822663587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284339335] [2025-03-04 07:41:46,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:46,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:46,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:46,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:46,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:46,702 INFO L87 Difference]: Start difference. First operand 352 states and 556 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-03-04 07:41:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:46,726 INFO L93 Difference]: Finished difference Result 493 states and 775 transitions. [2025-03-04 07:41:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:46,728 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-03-04 07:41:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:46,730 INFO L225 Difference]: With dead ends: 493 [2025-03-04 07:41:46,730 INFO L226 Difference]: Without dead ends: 493 [2025-03-04 07:41:46,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:46,730 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 49 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:46,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 108 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-04 07:41:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 473. [2025-03-04 07:41:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 426 states have (on average 1.6690140845070423) internal successors, (711), 450 states have internal predecessors, (711), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (43), 13 states have call predecessors, (43), 13 states have call successors, (43) [2025-03-04 07:41:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 767 transitions. [2025-03-04 07:41:46,742 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 767 transitions. Word has length 18 [2025-03-04 07:41:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:46,742 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 767 transitions. [2025-03-04 07:41:46,742 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-03-04 07:41:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 767 transitions. [2025-03-04 07:41:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:46,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:46,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:46,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:46,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:46,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:46,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash -104694319, now seen corresponding path program 1 times [2025-03-04 07:41:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315647862] [2025-03-04 07:41:46,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:46,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:46,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:46,946 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:46,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:41:46,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:46,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:46,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:46,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:46,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:41:46,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:46,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:46,996 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:46,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315647862] [2025-03-04 07:41:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315647862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:46,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:46,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:46,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404633984] [2025-03-04 07:41:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:46,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:46,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:46,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:46,997 INFO L87 Difference]: Start difference. First operand 473 states and 767 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-03-04 07:41:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:47,005 INFO L93 Difference]: Finished difference Result 472 states and 761 transitions. [2025-03-04 07:41:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:47,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-03-04 07:41:47,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:47,007 INFO L225 Difference]: With dead ends: 472 [2025-03-04 07:41:47,007 INFO L226 Difference]: Without dead ends: 472 [2025-03-04 07:41:47,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:47,007 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:47,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-04 07:41:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-04 07:41:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 426 states have (on average 1.6549295774647887) internal successors, (705), 449 states have internal predecessors, (705), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (43), 13 states have call predecessors, (43), 13 states have call successors, (43) [2025-03-04 07:41:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 761 transitions. [2025-03-04 07:41:47,018 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 761 transitions. Word has length 18 [2025-03-04 07:41:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:47,018 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 761 transitions. [2025-03-04 07:41:47,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-03-04 07:41:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 761 transitions. [2025-03-04 07:41:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:41:47,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:47,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:47,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:41:47,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,223 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:47,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:47,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1049442653, now seen corresponding path program 1 times [2025-03-04 07:41:47,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:47,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379897085] [2025-03-04 07:41:47,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:47,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:47,225 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:47,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:41:47,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:41:47,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:41:47,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:47,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:47,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:47,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:47,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:47,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:47,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379897085] [2025-03-04 07:41:47,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379897085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:47,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:47,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965740135] [2025-03-04 07:41:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:47,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:47,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:47,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:47,329 INFO L87 Difference]: Start difference. First operand 472 states and 761 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:47,377 INFO L93 Difference]: Finished difference Result 544 states and 848 transitions. [2025-03-04 07:41:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:47,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 19 [2025-03-04 07:41:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:47,379 INFO L225 Difference]: With dead ends: 544 [2025-03-04 07:41:47,379 INFO L226 Difference]: Without dead ends: 544 [2025-03-04 07:41:47,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:47,380 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 41 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:47,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-04 07:41:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 525. [2025-03-04 07:41:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 476 states have (on average 1.638655462184874) internal successors, (780), 500 states have internal predecessors, (780), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2025-03-04 07:41:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 840 transitions. [2025-03-04 07:41:47,391 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 840 transitions. Word has length 19 [2025-03-04 07:41:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:47,391 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 840 transitions. [2025-03-04 07:41:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 840 transitions. [2025-03-04 07:41:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:41:47,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:47,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:47,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:41:47,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:47,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1049443390, now seen corresponding path program 1 times [2025-03-04 07:41:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:47,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963200202] [2025-03-04 07:41:47,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:47,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:47,595 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:47,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:41:47,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:41:47,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:41:47,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:47,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:47,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:41:47,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:47,650 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:47,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963200202] [2025-03-04 07:41:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963200202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:47,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:47,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550580429] [2025-03-04 07:41:47,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:47,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:47,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:47,651 INFO L87 Difference]: Start difference. First operand 525 states and 840 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:47,658 INFO L93 Difference]: Finished difference Result 480 states and 773 transitions. [2025-03-04 07:41:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:47,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2025-03-04 07:41:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:47,661 INFO L225 Difference]: With dead ends: 480 [2025-03-04 07:41:47,661 INFO L226 Difference]: Without dead ends: 480 [2025-03-04 07:41:47,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:47,663 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:47,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-04 07:41:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-04 07:41:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 436 states have (on average 1.635321100917431) internal successors, (713), 455 states have internal predecessors, (713), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2025-03-04 07:41:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 773 transitions. [2025-03-04 07:41:47,676 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 773 transitions. Word has length 19 [2025-03-04 07:41:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:47,676 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 773 transitions. [2025-03-04 07:41:47,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 773 transitions. [2025-03-04 07:41:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:41:47,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:47,678 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 07:41:47,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:47,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:47,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1741625687, now seen corresponding path program 2 times [2025-03-04 07:41:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:47,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849146634] [2025-03-04 07:41:47,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:47,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:47,886 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:47,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:41:47,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 07:41:47,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:41:47,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:47,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:47,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:47,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:47,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:48,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:48,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849146634] [2025-03-04 07:41:48,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849146634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:48,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:48,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 07:41:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628605636] [2025-03-04 07:41:48,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:48,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:41:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:48,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:41:48,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:48,001 INFO L87 Difference]: Start difference. First operand 480 states and 773 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:48,075 INFO L93 Difference]: Finished difference Result 406 states and 603 transitions. [2025-03-04 07:41:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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 22 [2025-03-04 07:41:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:48,077 INFO L225 Difference]: With dead ends: 406 [2025-03-04 07:41:48,077 INFO L226 Difference]: Without dead ends: 406 [2025-03-04 07:41:48,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:48,077 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:48,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 280 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-04 07:41:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 389. [2025-03-04 07:41:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 345 states have (on average 1.5130434782608695) internal successors, (522), 364 states have internal predecessors, (522), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2025-03-04 07:41:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 582 transitions. [2025-03-04 07:41:48,085 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 582 transitions. Word has length 22 [2025-03-04 07:41:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:48,086 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 582 transitions. [2025-03-04 07:41:48,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 582 transitions. [2025-03-04 07:41:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:41:48,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:48,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:48,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:41:48,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:48,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:48,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1554979290, now seen corresponding path program 1 times [2025-03-04 07:41:48,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998939026] [2025-03-04 07:41:48,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:48,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:48,289 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:48,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:41:48,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:41:48,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:41:48,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:48,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:48,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:41:48,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:48,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:48,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:48,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998939026] [2025-03-04 07:41:48,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998939026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:48,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:48,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618424185] [2025-03-04 07:41:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:48,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:48,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:48,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:48,343 INFO L87 Difference]: Start difference. First operand 389 states and 582 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:48,350 INFO L93 Difference]: Finished difference Result 277 states and 394 transitions. [2025-03-04 07:41:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 07:41:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:48,352 INFO L225 Difference]: With dead ends: 277 [2025-03-04 07:41:48,352 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 07:41:48,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:48,352 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:48,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 07:41:48,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2025-03-04 07:41:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.4813278008298756) internal successors, (357), 258 states have internal predecessors, (357), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 07:41:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 393 transitions. [2025-03-04 07:41:48,360 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 393 transitions. Word has length 25 [2025-03-04 07:41:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:48,360 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 393 transitions. [2025-03-04 07:41:48,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 393 transitions. [2025-03-04 07:41:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:41:48,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:48,363 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:48,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:41:48,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,564 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:48,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2014690822, now seen corresponding path program 1 times [2025-03-04 07:41:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:48,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013301420] [2025-03-04 07:41:48,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:48,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:48,566 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:48,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:41:48,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:48,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:48,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:48,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:48,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:41:48,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:48,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:48,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013301420] [2025-03-04 07:41:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013301420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:41:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889714974] [2025-03-04 07:41:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:48,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:48,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:48,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:48,695 INFO L87 Difference]: Start difference. First operand 276 states and 393 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:48,757 INFO L93 Difference]: Finished difference Result 301 states and 409 transitions. [2025-03-04 07:41:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:48,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 07:41:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:48,759 INFO L225 Difference]: With dead ends: 301 [2025-03-04 07:41:48,759 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 07:41:48,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:41:48,760 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:48,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 174 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 07:41:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 280. [2025-03-04 07:41:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 243 states have (on average 1.4650205761316872) internal successors, (356), 262 states have internal predecessors, (356), 10 states have call successors, (10), 7 states have call predecessors, (10), 13 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 07:41:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 392 transitions. [2025-03-04 07:41:48,765 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 392 transitions. Word has length 27 [2025-03-04 07:41:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:48,766 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 392 transitions. [2025-03-04 07:41:48,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:48,774 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 392 transitions. [2025-03-04 07:41:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:41:48,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:48,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:48,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:41:48,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,975 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:41:48,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1818177317, now seen corresponding path program 1 times [2025-03-04 07:41:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999488843] [2025-03-04 07:41:48,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:48,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:48,980 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:48,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:41:49,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:49,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:49,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:49,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:49,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:49,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:49,166 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:41:49,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:41:49,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:49,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:49,444 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-03-04 07:41:49,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2025-03-04 07:41:53,869 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-03-04 07:41:53,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2025-03-04 07:41:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:53,965 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999488843] [2025-03-04 07:41:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999488843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:53,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:53,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2025-03-04 07:41:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358237695] [2025-03-04 07:41:53,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:53,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:41:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:53,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:41:53,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2025-03-04 07:41:53,968 INFO L87 Difference]: Start difference. First operand 280 states and 392 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:57,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:42:04,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 07:42:05,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 07:42:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:05,544 INFO L93 Difference]: Finished difference Result 298 states and 388 transitions. [2025-03-04 07:42:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:42:05,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-04 07:42:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:05,545 INFO L225 Difference]: With dead ends: 298 [2025-03-04 07:42:05,545 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 07:42:05,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=107, Invalid=195, Unknown=4, NotChecked=0, Total=306 [2025-03-04 07:42:05,546 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 186 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 38 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:05,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 63 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 81 Invalid, 17 Unknown, 0 Unchecked, 10.6s Time] [2025-03-04 07:42:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 07:42:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 285. [2025-03-04 07:42:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 249 states have (on average 1.357429718875502) internal successors, (338), 267 states have internal predecessors, (338), 10 states have call successors, (10), 7 states have call predecessors, (10), 15 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-04 07:42:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 377 transitions. [2025-03-04 07:42:05,552 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 377 transitions. Word has length 27 [2025-03-04 07:42:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:05,553 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 377 transitions. [2025-03-04 07:42:05,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:42:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 377 transitions. [2025-03-04 07:42:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:42:05,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:05,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:05,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 07:42:05,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:05,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:42:05,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash -742854348, now seen corresponding path program 1 times [2025-03-04 07:42:05,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:05,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934763590] [2025-03-04 07:42:05,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:05,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:05,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:05,757 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:05,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 07:42:05,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:42:05,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:42:05,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:05,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:05,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:42:05,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:07,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:42:07,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:07,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934763590] [2025-03-04 07:42:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934763590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:42:07,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:42:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:42:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476105694] [2025-03-04 07:42:07,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:42:07,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:42:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:07,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:42:07,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:42:07,765 INFO L87 Difference]: Start difference. First operand 285 states and 377 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:42:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:09,063 INFO L93 Difference]: Finished difference Result 304 states and 388 transitions. [2025-03-04 07:42:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:42:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 07:42:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:09,065 INFO L225 Difference]: With dead ends: 304 [2025-03-04 07:42:09,065 INFO L226 Difference]: Without dead ends: 304 [2025-03-04 07:42:09,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:42:09,065 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 96 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:09,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 203 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 07:42:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-04 07:42:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2025-03-04 07:42:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 258 states have (on average 1.3449612403100775) internal successors, (347), 276 states have internal predecessors, (347), 10 states have call successors, (10), 7 states have call predecessors, (10), 15 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-04 07:42:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 386 transitions. [2025-03-04 07:42:09,072 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 386 transitions. Word has length 28 [2025-03-04 07:42:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:09,072 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 386 transitions. [2025-03-04 07:42:09,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:42:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 386 transitions. [2025-03-04 07:42:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:42:09,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:09,073 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:09,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 07:42:09,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:09,277 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:42:09,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash -783288094, now seen corresponding path program 1 times [2025-03-04 07:42:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:09,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746307906] [2025-03-04 07:42:09,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:09,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:09,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:09,279 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:09,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 07:42:09,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:42:09,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:42:09,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:09,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:09,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:42:09,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:11,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:11,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:42:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:12,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:17,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746307906] [2025-03-04 07:42:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746307906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [606228018] [2025-03-04 07:42:17,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:42:17,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:42:17,145 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:42:17,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2025-03-04 07:42:17,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:42:17,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:42:17,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:17,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:17,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:42:17,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:19,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:19,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:42:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:19,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [606228018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:24,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:24,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2025-03-04 07:42:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832931480] [2025-03-04 07:42:24,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:24,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:42:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:24,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:42:24,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2025-03-04 07:42:24,179 INFO L87 Difference]: Start difference. First operand 294 states and 386 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:42:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:27,224 INFO L93 Difference]: Finished difference Result 308 states and 394 transitions. [2025-03-04 07:42:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:42:27,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 07:42:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:27,226 INFO L225 Difference]: With dead ends: 308 [2025-03-04 07:42:27,226 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 07:42:27,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=143, Invalid=362, Unknown=1, NotChecked=0, Total=506 [2025-03-04 07:42:27,227 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 184 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:27,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 112 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 07:42:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 07:42:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 299. [2025-03-04 07:42:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 279 states have internal predecessors, (347), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 07:42:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 390 transitions. [2025-03-04 07:42:27,234 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 390 transitions. Word has length 29 [2025-03-04 07:42:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:27,234 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 390 transitions. [2025-03-04 07:42:27,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:42:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 390 transitions. [2025-03-04 07:42:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:42:27,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:27,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:27,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2025-03-04 07:42:27,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 07:42:27,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:27,636 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:42:27,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1487872880, now seen corresponding path program 1 times [2025-03-04 07:42:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:27,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761597171] [2025-03-04 07:42:27,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:27,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:27,638 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:27,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 07:42:27,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:42:27,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:42:27,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:27,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:27,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:42:27,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:28,062 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (select |c_#valid| |parse_input_c1_~x~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|)))) is different from true [2025-03-04 07:42:28,386 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:42:28,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:42:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:28,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:29,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761597171] [2025-03-04 07:42:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761597171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:29,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:29,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2025-03-04 07:42:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732851937] [2025-03-04 07:42:29,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:29,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:42:29,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:29,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:42:29,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2025-03-04 07:42:29,898 INFO L87 Difference]: Start difference. First operand 299 states and 390 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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-03-04 07:42:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:32,274 INFO L93 Difference]: Finished difference Result 421 states and 512 transitions. [2025-03-04 07:42:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:42:32,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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 30 [2025-03-04 07:42:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:32,275 INFO L225 Difference]: With dead ends: 421 [2025-03-04 07:42:32,275 INFO L226 Difference]: Without dead ends: 421 [2025-03-04 07:42:32,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=118, Invalid=265, Unknown=1, NotChecked=36, Total=420 [2025-03-04 07:42:32,276 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 246 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:32,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 213 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 147 Unchecked, 1.4s Time] [2025-03-04 07:42:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-04 07:42:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 369. [2025-03-04 07:42:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 329 states have (on average 1.2917933130699089) internal successors, (425), 347 states have internal predecessors, (425), 11 states have call successors, (11), 10 states have call predecessors, (11), 18 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 07:42:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 467 transitions. [2025-03-04 07:42:32,287 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 467 transitions. Word has length 30 [2025-03-04 07:42:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:32,287 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 467 transitions. [2025-03-04 07:42:32,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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-03-04 07:42:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 467 transitions. [2025-03-04 07:42:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:42:32,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:32,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:32,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 07:42:32,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:32,489 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-04 07:42:32,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1120580960, now seen corresponding path program 1 times [2025-03-04 07:42:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:32,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304886938] [2025-03-04 07:42:32,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:32,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:32,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:32,493 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:32,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 07:42:32,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:42:32,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:42:32,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:32,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:32,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:42:32,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:33,115 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|)))) is different from true [2025-03-04 07:42:33,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:33,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:42:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:33,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:34,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:34,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304886938] [2025-03-04 07:42:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304886938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:34,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [484628233] [2025-03-04 07:42:34,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:34,609 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:42:34,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:42:34,611 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:42:34,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2025-03-04 07:42:34,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:42:34,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:42:34,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:34,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:34,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:42:34,734 INFO L279 TraceCheckSpWp]: Computing forward predicates...