./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.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_2.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 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:41:05,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:05,058 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,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:05,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:05,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:05,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:05,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:05,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:05,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:05,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:05,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:05,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:05,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:05,085 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:05,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:05,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:05,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:05,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:05,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:05,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:05,086 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:05,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:05,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:41:05,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:41:05,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:05,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:05,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:05,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:05,087 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2025-03-04 07:41:05,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:05,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:05,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:05,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:05,308 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:05,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-03-04 07:41:06,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d55fe895/945f507accc748ca80f35dba9065c2dc/FLAGcd59b878f [2025-03-04 07:41:06,767 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:06,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-03-04 07:41:06,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d55fe895/945f507accc748ca80f35dba9065c2dc/FLAGcd59b878f [2025-03-04 07:41:07,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d55fe895/945f507accc748ca80f35dba9065c2dc [2025-03-04 07:41:07,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:07,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:07,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:07,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:07,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:07,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb3c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:07, skipping insertion in model container [2025-03-04 07:41:07,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:07" (1/1) ... [2025-03-04 07:41:07,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:07,328 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,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:07,344 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:41:07,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:07,407 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:41:07,408 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,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:07,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:07,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:41:07,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:41:07,416 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,425 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,440 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-03-04 07:41:07,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:07,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:41:07,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:41:07,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:41:07,448 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,448 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,451 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,464 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, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 07:41:07,464 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,464 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,469 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,469 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,474 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,475 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,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:41:07,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:41:07,477 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:41:07,477 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:41:07,481 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,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:07,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:07,507 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,513 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,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:41:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:41:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-03-04 07:41:07,533 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:41:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:41:07,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:41:07,642 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:41:07,645 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:41:07,794 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-04 07:41:07,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:41:07,802 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:41:07,802 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:41:07,803 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,803 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:41:07,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:41:07,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:41:07,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:41:07,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:41:07" (1/3) ... [2025-03-04 07:41:07,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dac45cb 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,810 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,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dac45cb 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,810 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,811 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2025-03-04 07:41:07,822 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:07,823 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-03-04 07:41:07,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:07,856 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;@1a25d038, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:07,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 07:41:07,859 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,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:07,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:07,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:07,863 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,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:07,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1396543346, now seen corresponding path program 1 times [2025-03-04 07:41:07,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:07,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766907485] [2025-03-04 07:41:07,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:07,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:07,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:07,954 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,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:07,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,121 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,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766907485] [2025-03-04 07:41:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766907485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:08,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488761216] [2025-03-04 07:41:08,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:08,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:08,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:08,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:08,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:08,149 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,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:08,265 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2025-03-04 07:41:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:08,267 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,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:08,271 INFO L225 Difference]: With dead ends: 124 [2025-03-04 07:41:08,272 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 07:41:08,274 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,275 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 148 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 107 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,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 107 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,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 07:41:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2025-03-04 07:41:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 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,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2025-03-04 07:41:08,302 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 6 [2025-03-04 07:41:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:08,303 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2025-03-04 07:41:08,303 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,303 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2025-03-04 07:41:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:08,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:08,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:08,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:41:08,304 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,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1396543345, now seen corresponding path program 1 times [2025-03-04 07:41:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:08,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370294448] [2025-03-04 07:41:08,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:08,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:08,326 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,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:08,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,463 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,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:08,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370294448] [2025-03-04 07:41:08,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370294448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:08,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:08,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395695518] [2025-03-04 07:41:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:08,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:08,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:08,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:08,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:08,467 INFO L87 Difference]: Start difference. First operand 92 states and 123 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,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:08,612 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2025-03-04 07:41:08,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:08,612 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,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:08,614 INFO L225 Difference]: With dead ends: 191 [2025-03-04 07:41:08,614 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 07:41:08,614 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,614 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 82 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:08,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 204 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 07:41:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 168. [2025-03-04 07:41:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 07:41:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2025-03-04 07:41:08,629 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 6 [2025-03-04 07:41:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:08,630 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2025-03-04 07:41:08,630 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,630 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2025-03-04 07:41:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:41:08,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:08,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:08,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:41:08,630 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,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:08,631 INFO L85 PathProgramCache]: Analyzing trace with hash -343170744, now seen corresponding path program 1 times [2025-03-04 07:41:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312306588] [2025-03-04 07:41:08,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:08,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:41:08,650 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,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:08,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,827 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,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312306588] [2025-03-04 07:41:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312306588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:08,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634328048] [2025-03-04 07:41:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:08,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:08,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:08,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:08,829 INFO L87 Difference]: Start difference. First operand 168 states and 261 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,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:08,963 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2025-03-04 07:41:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:08,963 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,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:08,965 INFO L225 Difference]: With dead ends: 208 [2025-03-04 07:41:08,965 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 07:41:08,965 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,966 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 157 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,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 157 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,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 07:41:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 171. [2025-03-04 07:41:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 07:41:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions. [2025-03-04 07:41:08,983 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 7 [2025-03-04 07:41:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:08,983 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 264 transitions. [2025-03-04 07:41:08,984 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,984 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions. [2025-03-04 07:41:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:41:08,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:08,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:08,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:41:08,984 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,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2048358452, now seen corresponding path program 1 times [2025-03-04 07:41:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:08,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060770631] [2025-03-04 07:41:08,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:08,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:41:09,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:41:09,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,148 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,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060770631] [2025-03-04 07:41:09,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060770631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:09,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:09,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:09,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415318467] [2025-03-04 07:41:09,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:09,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:09,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:09,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:09,150 INFO L87 Difference]: Start difference. First operand 171 states and 264 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,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:09,249 INFO L93 Difference]: Finished difference Result 193 states and 266 transitions. [2025-03-04 07:41:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:09,250 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,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:09,251 INFO L225 Difference]: With dead ends: 193 [2025-03-04 07:41:09,251 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 07:41:09,251 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:09,251 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 63 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 201 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,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 201 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,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 07:41:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 171. [2025-03-04 07:41:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 07:41:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2025-03-04 07:41:09,266 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 8 [2025-03-04 07:41:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:09,266 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2025-03-04 07:41:09,266 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,270 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2025-03-04 07:41:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:41:09,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:09,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:09,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:41:09,270 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,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash 925397446, now seen corresponding path program 1 times [2025-03-04 07:41:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974032068] [2025-03-04 07:41:09,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:09,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:09,277 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,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,320 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,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974032068] [2025-03-04 07:41:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974032068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:09,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:09,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264985505] [2025-03-04 07:41:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:09,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:09,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:09,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:09,321 INFO L87 Difference]: Start difference. First operand 171 states and 262 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,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:09,396 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2025-03-04 07:41:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:09,396 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,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:09,397 INFO L225 Difference]: With dead ends: 250 [2025-03-04 07:41:09,398 INFO L226 Difference]: Without dead ends: 250 [2025-03-04 07:41:09,398 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,398 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 133 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:09,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 190 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-04 07:41:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2025-03-04 07:41:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 07:41:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 312 transitions. [2025-03-04 07:41:09,408 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 312 transitions. Word has length 9 [2025-03-04 07:41:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:09,408 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 312 transitions. [2025-03-04 07:41:09,408 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,408 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 312 transitions. [2025-03-04 07:41:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:09,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:09,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:09,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:41:09,409 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,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:09,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1377450230, now seen corresponding path program 1 times [2025-03-04 07:41:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937570924] [2025-03-04 07:41:09,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:09,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:09,419 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,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,476 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,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937570924] [2025-03-04 07:41:09,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937570924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:09,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:09,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118981953] [2025-03-04 07:41:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:09,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:09,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:09,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:09,478 INFO L87 Difference]: Start difference. First operand 207 states and 312 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,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:09,555 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2025-03-04 07:41:09,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:09,555 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,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:09,556 INFO L225 Difference]: With dead ends: 245 [2025-03-04 07:41:09,556 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 07:41:09,556 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,557 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 120 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 210 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,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 210 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,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 07:41:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2025-03-04 07:41:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 07:41:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2025-03-04 07:41:09,570 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 10 [2025-03-04 07:41:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:09,570 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2025-03-04 07:41:09,570 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,570 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2025-03-04 07:41:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:41:09,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:09,570 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:09,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:41:09,570 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,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash 675125788, now seen corresponding path program 1 times [2025-03-04 07:41:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:09,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033140337] [2025-03-04 07:41:09,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:09,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:09,580 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,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,702 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,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033140337] [2025-03-04 07:41:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033140337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40543158] [2025-03-04 07:41:09,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:09,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:09,705 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,720 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,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:09,775 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,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:09,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:09,939 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,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:10,034 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:10,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40543158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:10,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:10,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-03-04 07:41:10,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599619250] [2025-03-04 07:41:10,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:10,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:41:10,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:10,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:41:10,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:10,036 INFO L87 Difference]: Start difference. First operand 217 states and 325 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,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:10,188 INFO L93 Difference]: Finished difference Result 240 states and 324 transitions. [2025-03-04 07:41:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:10,189 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,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:10,190 INFO L225 Difference]: With dead ends: 240 [2025-03-04 07:41:10,190 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 07:41:10,190 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,191 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 233 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:10,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 384 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:10,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 07:41:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2025-03-04 07:41:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.5054945054945055) internal successors, (274), 201 states have internal predecessors, (274), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 07:41:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 319 transitions. [2025-03-04 07:41:10,203 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 319 transitions. Word has length 14 [2025-03-04 07:41:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:10,203 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 319 transitions. [2025-03-04 07:41:10,203 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,203 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 319 transitions. [2025-03-04 07:41:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:41:10,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:10,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:10,210 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,404 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,404 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,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -545937061, now seen corresponding path program 1 times [2025-03-04 07:41:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:10,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435018481] [2025-03-04 07:41:10,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:10,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:10,417 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,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:10,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:10,520 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,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:10,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435018481] [2025-03-04 07:41:10,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435018481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:10,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051041327] [2025-03-04 07:41:10,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:10,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:10,525 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,528 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,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:10,575 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,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:10,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:10,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:10,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:10,710 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,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:10,777 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,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051041327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:10,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:10,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-04 07:41:10,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460115770] [2025-03-04 07:41:10,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:10,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:41:10,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:10,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:41:10,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:41:10,778 INFO L87 Difference]: Start difference. First operand 220 states and 319 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,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:10,998 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2025-03-04 07:41:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:41:10,999 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,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:11,000 INFO L225 Difference]: With dead ends: 258 [2025-03-04 07:41:11,000 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 07:41:11,000 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:11,000 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 124 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:11,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 356 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 07:41:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 228. [2025-03-04 07:41:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 190 states have (on average 1.5) internal successors, (285), 209 states have internal predecessors, (285), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 07:41:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 330 transitions. [2025-03-04 07:41:11,007 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 330 transitions. Word has length 15 [2025-03-04 07:41:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:11,007 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 330 transitions. [2025-03-04 07:41:11,007 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:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 330 transitions. [2025-03-04 07:41:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:41:11,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:11,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:11,014 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,212 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,212 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,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash 255820313, now seen corresponding path program 1 times [2025-03-04 07:41:11,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:11,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365832504] [2025-03-04 07:41:11,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:11,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:41:11,222 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,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,365 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,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365832504] [2025-03-04 07:41:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365832504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965032409] [2025-03-04 07:41:11,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:11,367 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,369 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,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:41:11,417 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,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:41:11,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:11,583 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,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:11,685 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,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965032409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:11,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:11,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-04 07:41:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920296806] [2025-03-04 07:41:11,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:11,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:11,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:11,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:11,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:11,687 INFO L87 Difference]: Start difference. First operand 228 states and 330 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,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,107 INFO L93 Difference]: Finished difference Result 385 states and 531 transitions. [2025-03-04 07:41:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:41:12,107 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,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,109 INFO L225 Difference]: With dead ends: 385 [2025-03-04 07:41:12,109 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 07:41:12,109 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,109 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 224 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:12,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 617 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 07:41:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 323. [2025-03-04 07:41:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 279 states have (on average 1.5412186379928314) internal successors, (430), 298 states have internal predecessors, (430), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2025-03-04 07:41:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2025-03-04 07:41:12,118 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 16 [2025-03-04 07:41:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,118 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2025-03-04 07:41:12,118 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,119 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2025-03-04 07:41:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:12,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,119 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,125 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:12,323 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,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash -104700271, now seen corresponding path program 1 times [2025-03-04 07:41:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318622845] [2025-03-04 07:41:12,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:12,329 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,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,344 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,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318622845] [2025-03-04 07:41:12,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318622845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:12,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:12,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279901324] [2025-03-04 07:41:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:12,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:12,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:12,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:12,345 INFO L87 Difference]: Start difference. First operand 323 states and 494 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,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,354 INFO L93 Difference]: Finished difference Result 243 states and 359 transitions. [2025-03-04 07:41:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:12,355 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,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,356 INFO L225 Difference]: With dead ends: 243 [2025-03-04 07:41:12,356 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 07:41:12,356 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,356 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,356 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,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 07:41:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-04 07:41:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.4976303317535544) internal successors, (316), 223 states have internal predecessors, (316), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-04 07:41:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 359 transitions. [2025-03-04 07:41:12,362 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 359 transitions. Word has length 18 [2025-03-04 07:41:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,362 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 359 transitions. [2025-03-04 07:41:12,362 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,362 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 359 transitions. [2025-03-04 07:41:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:41:12,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,363 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,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:41:12,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1049689854, now seen corresponding path program 1 times [2025-03-04 07:41:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481112241] [2025-03-04 07:41:12,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:41:12,369 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,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,416 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,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481112241] [2025-03-04 07:41:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481112241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211013736] [2025-03-04 07:41:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:12,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:12,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:12,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:12,418 INFO L87 Difference]: Start difference. First operand 243 states and 359 transitions. Second operand has 3 states, 3 states have (on average 6.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,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,431 INFO L93 Difference]: Finished difference Result 277 states and 385 transitions. [2025-03-04 07:41:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.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,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,432 INFO L225 Difference]: With dead ends: 277 [2025-03-04 07:41:12,432 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 07:41:12,433 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,434 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:12,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 94 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 07:41:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 268. [2025-03-04 07:41:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.4661016949152543) internal successors, (346), 250 states have internal predecessors, (346), 10 states have call successors, (10), 7 states have call predecessors, (10), 10 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) [2025-03-04 07:41:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 383 transitions. [2025-03-04 07:41:12,440 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 383 transitions. Word has length 19 [2025-03-04 07:41:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,440 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 383 transitions. [2025-03-04 07:41:12,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.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,441 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 383 transitions. [2025-03-04 07:41:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:41:12,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,442 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,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:41:12,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,443 INFO L85 PathProgramCache]: Analyzing trace with hash 873060588, now seen corresponding path program 1 times [2025-03-04 07:41:12,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438692480] [2025-03-04 07:41:12,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:41:12,452 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,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,464 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,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438692480] [2025-03-04 07:41:12,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438692480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:12,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:12,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:12,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145152133] [2025-03-04 07:41:12,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:12,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:12,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:12,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:12,466 INFO L87 Difference]: Start difference. First operand 268 states and 383 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,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,470 INFO L93 Difference]: Finished difference Result 194 states and 261 transitions. [2025-03-04 07:41:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:12,470 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,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,471 INFO L225 Difference]: With dead ends: 194 [2025-03-04 07:41:12,471 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 07:41:12,471 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,472 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 88 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,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 88 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,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 07:41:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-04 07:41:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 168 states have (on average 1.4166666666666667) internal successors, (238), 181 states have internal predecessors, (238), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 07:41:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2025-03-04 07:41:12,476 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 25 [2025-03-04 07:41:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,476 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2025-03-04 07:41:12,476 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,476 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2025-03-04 07:41:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:41:12,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,476 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,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:41:12,476 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,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2088925211, now seen corresponding path program 1 times [2025-03-04 07:41:12,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-03-04 07:41:12,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:12,488 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,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,657 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,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-03-04 07:41:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007299962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922434734] [2025-03-04 07:41:12,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:12,659 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,660 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,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:12,712 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,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:41:12,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:12,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:12,932 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:12,979 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,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:13,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922434734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:13,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2025-03-04 07:41:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002303955] [2025-03-04 07:41:13,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:13,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:41:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:13,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:41:13,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:41:13,102 INFO L87 Difference]: Start difference. First operand 194 states and 261 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,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:13,420 INFO L93 Difference]: Finished difference Result 223 states and 284 transitions. [2025-03-04 07:41:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:41:13,420 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,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:13,421 INFO L225 Difference]: With dead ends: 223 [2025-03-04 07:41:13,421 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 07:41:13,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:41:13,422 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 243 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:13,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 115 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 07:41:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 210. [2025-03-04 07:41:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 182 states have (on average 1.3846153846153846) internal successors, (252), 197 states have internal predecessors, (252), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-04 07:41:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 276 transitions. [2025-03-04 07:41:13,428 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 276 transitions. Word has length 27 [2025-03-04 07:41:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:13,429 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 276 transitions. [2025-03-04 07:41:13,429 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,429 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2025-03-04 07:41:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:41:13,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:13,430 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] [2025-03-04 07:41:13,437 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,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:13,636 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:13,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1809910584, now seen corresponding path program 1 times [2025-03-04 07:41:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:13,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247581079] [2025-03-04 07:41:13,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:13,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:13,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:41:13,646 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,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:13,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:13,711 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:13,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247581079] [2025-03-04 07:41:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247581079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12775077] [2025-03-04 07:41:13,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:13,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:13,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:13,714 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,716 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,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:41:13,771 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,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:13,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:13,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:13,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:13,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12775077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:13,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:41:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-03-04 07:41:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412079488] [2025-03-04 07:41:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:41:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:13,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:41:13,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:13,863 INFO L87 Difference]: Start difference. First operand 210 states and 276 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:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:13,910 INFO L93 Difference]: Finished difference Result 227 states and 289 transitions. [2025-03-04 07:41:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:13,911 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:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:13,912 INFO L225 Difference]: With dead ends: 227 [2025-03-04 07:41:13,912 INFO L226 Difference]: Without dead ends: 227 [2025-03-04 07:41:13,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:13,913 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:13,913 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:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-04 07:41:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 219. [2025-03-04 07:41:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 206 states have internal predecessors, (261), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-04 07:41:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 285 transitions. [2025-03-04 07:41:13,920 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 285 transitions. Word has length 28 [2025-03-04 07:41:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:13,920 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 285 transitions. [2025-03-04 07:41:13,921 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:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 285 transitions. [2025-03-04 07:41:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:41:13,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:13,921 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:13,927 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,121 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,SelfDestructingSolverStorable13 [2025-03-04 07:41:14,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:14,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1707400798, now seen corresponding path program 1 times [2025-03-04 07:41:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:14,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276173911] [2025-03-04 07:41:14,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:14,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:14,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:41:14,136 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,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:14,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:14,463 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,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276173911] [2025-03-04 07:41:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276173911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196710263] [2025-03-04 07:41:14,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:14,466 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,467 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,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:41:14,520 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,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:14,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 07:41:14,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:14,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:14,778 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:14,860 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:14,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196710263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:14,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:14,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2025-03-04 07:41:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629500656] [2025-03-04 07:41:14,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:14,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:41:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:14,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:41:14,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:41:14,979 INFO L87 Difference]: Start difference. First operand 219 states and 285 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,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:15,334 INFO L93 Difference]: Finished difference Result 229 states and 288 transitions. [2025-03-04 07:41:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:41:15,335 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,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:15,336 INFO L225 Difference]: With dead ends: 229 [2025-03-04 07:41:15,336 INFO L226 Difference]: Without dead ends: 229 [2025-03-04 07:41:15,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:41:15,336 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 325 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:15,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 193 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-04 07:41:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2025-03-04 07:41:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 191 states have (on average 1.350785340314136) internal successors, (258), 206 states have internal predecessors, (258), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-04 07:41:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 282 transitions. [2025-03-04 07:41:15,341 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 282 transitions. Word has length 29 [2025-03-04 07:41:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:15,341 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 282 transitions. [2025-03-04 07:41:15,342 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,342 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2025-03-04 07:41:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:41:15,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:15,342 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,349 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,542 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,SelfDestructingSolverStorable14 [2025-03-04 07:41:15,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1389817168, now seen corresponding path program 1 times [2025-03-04 07:41:15,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:15,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104101747] [2025-03-04 07:41:15,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:15,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:41:15,554 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,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:15,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:15,672 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,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:15,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104101747] [2025-03-04 07:41:15,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104101747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:15,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239135969] [2025-03-04 07:41:15,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:15,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:15,675 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,677 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,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:41:15,733 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,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:15,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:15,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:41:15,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:15,807 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:15,808 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:15,843 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,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:15,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239135969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:15,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:15,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-03-04 07:41:15,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222362268] [2025-03-04 07:41:15,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:15,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:41:15,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:15,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:41:15,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:15,887 INFO L87 Difference]: Start difference. First operand 219 states and 282 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,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:16,155 INFO L93 Difference]: Finished difference Result 332 states and 396 transitions. [2025-03-04 07:41:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:41:16,156 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,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:16,157 INFO L225 Difference]: With dead ends: 332 [2025-03-04 07:41:16,157 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 07:41:16,157 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,158 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 358 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:16,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 296 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 07:41:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 299. [2025-03-04 07:41:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 284 states have internal predecessors, (353), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 07:41:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 376 transitions. [2025-03-04 07:41:16,164 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 376 transitions. Word has length 30 [2025-03-04 07:41:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:16,164 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 376 transitions. [2025-03-04 07:41:16,164 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,164 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 376 transitions. [2025-03-04 07:41:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:41:16,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:16,164 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,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:41:16,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:16,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash -134659232, now seen corresponding path program 1 times [2025-03-04 07:41:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:16,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322292517] [2025-03-04 07:41:16,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:16,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:41:16,374 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,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,512 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,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:16,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322292517] [2025-03-04 07:41:16,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322292517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:16,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600845729] [2025-03-04 07:41:16,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:16,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:16,514 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,516 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,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:41:16,567 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,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:41:16,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:16,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:16,663 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,713 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,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:16,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600845729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:16,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:16,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-03-04 07:41:16,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675668972] [2025-03-04 07:41:16,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:16,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:16,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:16,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:41:16,807 INFO L87 Difference]: Start difference. First operand 299 states and 376 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,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:17,168 INFO L93 Difference]: Finished difference Result 343 states and 402 transitions. [2025-03-04 07:41:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:41:17,168 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,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:17,170 INFO L225 Difference]: With dead ends: 343 [2025-03-04 07:41:17,170 INFO L226 Difference]: Without dead ends: 343 [2025-03-04 07:41:17,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:41:17,170 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 473 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:17,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 258 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-04 07:41:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 305. [2025-03-04 07:41:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 274 states have (on average 1.3175182481751824) internal successors, (361), 290 states have internal predecessors, (361), 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:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 381 transitions. [2025-03-04 07:41:17,176 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 381 transitions. Word has length 31 [2025-03-04 07:41:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:17,176 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 381 transitions. [2025-03-04 07:41:17,177 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,177 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 381 transitions. [2025-03-04 07:41:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:41:17,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:17,177 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,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:17,377 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,SelfDestructingSolverStorable16 [2025-03-04 07:41:17,378 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:17,378 INFO L85 PathProgramCache]: Analyzing trace with hash 149879666, now seen corresponding path program 1 times [2025-03-04 07:41:17,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:17,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11239996] [2025-03-04 07:41:17,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:17,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:41:17,388 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,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,559 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,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:17,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11239996] [2025-03-04 07:41:17,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11239996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:17,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784635037] [2025-03-04 07:41:17,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:17,561 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,562 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,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:41:17,610 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,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:41:17,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:17,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:17,768 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:17,875 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,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784635037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:18,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2025-03-04 07:41:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615612085] [2025-03-04 07:41:18,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:41:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:41:18,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:41:18,019 INFO L87 Difference]: Start difference. First operand 305 states and 381 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,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:18,432 INFO L93 Difference]: Finished difference Result 325 states and 388 transitions. [2025-03-04 07:41:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:41:18,432 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,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:18,434 INFO L225 Difference]: With dead ends: 325 [2025-03-04 07:41:18,434 INFO L226 Difference]: Without dead ends: 325 [2025-03-04 07:41:18,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:41:18,435 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 275 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:18,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 181 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-04 07:41:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 304. [2025-03-04 07:41:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 276 states have (on average 1.2644927536231885) internal successors, (349), 289 states have internal predecessors, (349), 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:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 369 transitions. [2025-03-04 07:41:18,443 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 369 transitions. Word has length 35 [2025-03-04 07:41:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:18,443 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 369 transitions. [2025-03-04 07:41:18,443 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,443 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 369 transitions. [2025-03-04 07:41:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:41:18,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:18,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:18,457 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,646 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,SelfDestructingSolverStorable17 [2025-03-04 07:41:18,646 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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:18,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1028981608, now seen corresponding path program 1 times [2025-03-04 07:41:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:18,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125719542] [2025-03-04 07:41:18,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:18,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:41:18,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:41:18,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:18,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125719542] [2025-03-04 07:41:18,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125719542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406386726] [2025-03-04 07:41:18,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:18,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:18,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:18,683 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,685 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,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:41:18,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:41:18,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:18,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:18,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:41:18,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:18,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:18,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406386726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:18,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:18,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 07:41:18,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256505246] [2025-03-04 07:41:18,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:18,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:18,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:18,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:18,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:18,795 INFO L87 Difference]: Start difference. First operand 304 states and 369 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:18,808 INFO L93 Difference]: Finished difference Result 303 states and 366 transitions. [2025-03-04 07:41:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 40 [2025-03-04 07:41:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:18,809 INFO L225 Difference]: With dead ends: 303 [2025-03-04 07:41:18,809 INFO L226 Difference]: Without dead ends: 303 [2025-03-04 07:41:18,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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:18,810 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:18,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 76 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-04 07:41:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-04 07:41:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 276 states have (on average 1.2536231884057971) internal successors, (346), 288 states have internal predecessors, (346), 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:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 366 transitions. [2025-03-04 07:41:18,815 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 366 transitions. Word has length 40 [2025-03-04 07:41:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:18,816 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 366 transitions. [2025-03-04 07:41:18,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 366 transitions. [2025-03-04 07:41:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:41:18,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:18,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:18,823 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,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:19,018 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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:19,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1833658771, now seen corresponding path program 1 times [2025-03-04 07:41:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:19,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977308892] [2025-03-04 07:41:19,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:19,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:41:19,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:41:19,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:19,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977308892] [2025-03-04 07:41:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977308892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206385892] [2025-03-04 07:41:19,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:19,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:19,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:19,074 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:19,075 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:19,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:41:19,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:41:19,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:19,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:19,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206385892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:19,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:19,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 07:41:19,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840890728] [2025-03-04 07:41:19,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:19,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:19,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:19,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:19,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:19,210 INFO L87 Difference]: Start difference. First operand 303 states and 366 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:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:19,231 INFO L93 Difference]: Finished difference Result 302 states and 363 transitions. [2025-03-04 07:41:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:19,232 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 41 [2025-03-04 07:41:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:19,233 INFO L225 Difference]: With dead ends: 302 [2025-03-04 07:41:19,233 INFO L226 Difference]: Without dead ends: 302 [2025-03-04 07:41:19,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 4 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:19,234 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:19,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 65 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-04 07:41:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-03-04 07:41:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 276 states have (on average 1.2427536231884058) internal successors, (343), 287 states have internal predecessors, (343), 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:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 363 transitions. [2025-03-04 07:41:19,241 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 363 transitions. Word has length 41 [2025-03-04 07:41:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:19,241 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 363 transitions. [2025-03-04 07:41:19,241 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:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 363 transitions. [2025-03-04 07:41:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:41:19,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:19,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:19,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:19,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:19,442 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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:19,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:19,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1008847046, now seen corresponding path program 1 times [2025-03-04 07:41:19,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:19,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56485034] [2025-03-04 07:41:19,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:19,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:41:19,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:41:19,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:19,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:19,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56485034] [2025-03-04 07:41:19,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56485034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:19,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912051372] [2025-03-04 07:41:19,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:19,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:19,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:19,521 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:19,521 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:19,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:41:19,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:41:19,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:19,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:19,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:19,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:41:19,629 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:41:19,629 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:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912051372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:19,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 07:41:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100371190] [2025-03-04 07:41:19,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:19,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:19,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:19,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:19,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:19,686 INFO L87 Difference]: Start difference. First operand 302 states and 363 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:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:19,734 INFO L93 Difference]: Finished difference Result 321 states and 377 transitions. [2025-03-04 07:41:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:19,735 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 42 [2025-03-04 07:41:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:19,736 INFO L225 Difference]: With dead ends: 321 [2025-03-04 07:41:19,736 INFO L226 Difference]: Without dead ends: 321 [2025-03-04 07:41:19,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 2 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:19,736 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 25 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:19,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 112 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-04 07:41:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 302. [2025-03-04 07:41:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 276 states have (on average 1.2355072463768115) internal successors, (341), 287 states have internal predecessors, (341), 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:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 361 transitions. [2025-03-04 07:41:19,744 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 361 transitions. Word has length 42 [2025-03-04 07:41:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:19,744 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 361 transitions. [2025-03-04 07:41:19,744 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:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 361 transitions. [2025-03-04 07:41:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:41:19,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:19,745 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:19,753 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:19,945 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,SelfDestructingSolverStorable20 [2025-03-04 07:41:19,946 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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:19,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1938951484, now seen corresponding path program 1 times [2025-03-04 07:41:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:19,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597191964] [2025-03-04 07:41:19,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:19,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:41:19,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:41:19,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:19,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,994 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:19,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:19,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597191964] [2025-03-04 07:41:19,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597191964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:19,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481074757] [2025-03-04 07:41:19,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:19,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:20,055 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:20,058 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:20,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:41:20,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:41:20,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:20,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:20,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:20,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:20,145 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:20,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481074757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:20,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:41:20,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-04 07:41:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914461809] [2025-03-04 07:41:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:20,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:20,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:20,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:20,147 INFO L87 Difference]: Start difference. First operand 302 states and 361 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:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:20,164 INFO L93 Difference]: Finished difference Result 298 states and 346 transitions. [2025-03-04 07:41:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:20,167 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:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:20,168 INFO L225 Difference]: With dead ends: 298 [2025-03-04 07:41:20,168 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 07:41:20,169 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:20,170 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:20,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 07:41:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2025-03-04 07:41:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 270 states have (on average 1.2074074074074075) internal successors, (326), 281 states have internal predecessors, (326), 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:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2025-03-04 07:41:20,174 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 45 [2025-03-04 07:41:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:20,174 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2025-03-04 07:41:20,174 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:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2025-03-04 07:41:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:41:20,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:20,175 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:20,181 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:20,378 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,SelfDestructingSolverStorable21 [2025-03-04 07:41:20,378 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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:20,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1272792830, now seen corresponding path program 1 times [2025-03-04 07:41:20,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:20,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876854302] [2025-03-04 07:41:20,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:20,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:20,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:20,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:20,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:20,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876854302] [2025-03-04 07:41:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876854302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001750121] [2025-03-04 07:41:20,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:20,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:20,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:20,555 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:20,557 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:20,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:20,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:20,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:20,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:20,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:41:20,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:20,743 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:41:20,743 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:20,843 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:20,843 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:20,870 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:41:20,871 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:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:20,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:20,939 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:41:20,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2025-03-04 07:41:21,098 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:41:21,098 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 56 treesize of output 53 [2025-03-04 07:41:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001750121] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:21,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2025-03-04 07:41:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670700691] [2025-03-04 07:41:21,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:21,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:41:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:21,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:41:21,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:41:21,218 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 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:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:21,353 INFO L93 Difference]: Finished difference Result 301 states and 351 transitions. [2025-03-04 07:41:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:21,353 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 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 51 [2025-03-04 07:41:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:21,354 INFO L225 Difference]: With dead ends: 301 [2025-03-04 07:41:21,354 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 07:41:21,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:41:21,355 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 171 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:21,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 142 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 07:41:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 295. [2025-03-04 07:41:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 270 states have (on average 1.2037037037037037) internal successors, (325), 280 states have internal predecessors, (325), 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:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2025-03-04 07:41:21,359 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 51 [2025-03-04 07:41:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:21,360 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2025-03-04 07:41:21,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 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:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2025-03-04 07:41:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:41:21,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:21,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:21,368 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:21,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:21,564 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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:21,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1215969222, now seen corresponding path program 1 times [2025-03-04 07:41:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760485467] [2025-03-04 07:41:21,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:21,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:21,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:21,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:21,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760485467] [2025-03-04 07:41:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760485467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198577058] [2025-03-04 07:41:21,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:21,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:21,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:21,609 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:21,611 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:21,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:21,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:21,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:21,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:21,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:41:21,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:21,740 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:21,741 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:21,757 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:21,773 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:41:21,773 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:21,823 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:21,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:21,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198577058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:21,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:21,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-03-04 07:41:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958026815] [2025-03-04 07:41:21,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:21,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:41:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:21,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:41:21,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2025-03-04 07:41:21,988 INFO L87 Difference]: Start difference. First operand 295 states and 345 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:41:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:22,480 INFO L93 Difference]: Finished difference Result 273 states and 304 transitions. [2025-03-04 07:41:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 07:41:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2025-03-04 07:41:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:22,481 INFO L225 Difference]: With dead ends: 273 [2025-03-04 07:41:22,481 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 07:41:22,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=977, Unknown=1, NotChecked=68, Total=1332 [2025-03-04 07:41:22,482 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 270 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:22,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 347 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 338 Invalid, 0 Unknown, 154 Unchecked, 0.2s Time] [2025-03-04 07:41:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 07:41:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 256. [2025-03-04 07:41:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.174468085106383) internal successors, (276), 243 states have internal predecessors, (276), 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:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 291 transitions. [2025-03-04 07:41:22,487 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 291 transitions. Word has length 51 [2025-03-04 07:41:22,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:22,488 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 291 transitions. [2025-03-04 07:41:22,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:41:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 291 transitions. [2025-03-04 07:41:22,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:41:22,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:22,489 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:22,495 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:22,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:22,694 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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:22,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:22,694 INFO L85 PathProgramCache]: Analyzing trace with hash 801872088, now seen corresponding path program 1 times [2025-03-04 07:41:22,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:22,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939381886] [2025-03-04 07:41:22,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:22,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:22,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:41:22,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:23,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:23,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939381886] [2025-03-04 07:41:23,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939381886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942655161] [2025-03-04 07:41:23,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:23,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:23,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:23,224 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:23,226 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:23,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:23,290 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,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:23,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:23,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 07:41:23,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:23,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:41:23,471 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:23,641 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:23,642 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:23,735 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:41:23,735 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 07:41:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:23,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:23,931 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-04 07:41:23,932 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 88 treesize of output 81 [2025-03-04 07:41:24,255 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-04 07:41:24,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 185 [2025-03-04 07:41:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942655161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:24,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:24,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 46 [2025-03-04 07:41:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612142080] [2025-03-04 07:41:24,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:24,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 07:41:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:24,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 07:41:24,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1922, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:41:24,562 INFO L87 Difference]: Start difference. First operand 256 states and 291 transitions. Second operand has 47 states, 43 states have (on average 3.255813953488372) internal successors, (140), 39 states have internal predecessors, (140), 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:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:25,158 INFO L93 Difference]: Finished difference Result 269 states and 301 transitions. [2025-03-04 07:41:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:41:25,159 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 3.255813953488372) internal successors, (140), 39 states have internal predecessors, (140), 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 52 [2025-03-04 07:41:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:25,160 INFO L225 Difference]: With dead ends: 269 [2025-03-04 07:41:25,160 INFO L226 Difference]: Without dead ends: 269 [2025-03-04 07:41:25,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=2933, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 07:41:25,161 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 369 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:25,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 327 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-04 07:41:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 256. [2025-03-04 07:41:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.1702127659574468) internal successors, (275), 243 states have internal predecessors, (275), 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:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 290 transitions. [2025-03-04 07:41:25,164 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 290 transitions. Word has length 52 [2025-03-04 07:41:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:25,164 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 290 transitions. [2025-03-04 07:41:25,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 3.255813953488372) internal successors, (140), 39 states have internal predecessors, (140), 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:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 290 transitions. [2025-03-04 07:41:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:41:25,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:25,170 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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:25,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:25,371 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,SelfDestructingSolverStorable24 [2025-03-04 07:41:25,371 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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:25,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:25,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1787933148, now seen corresponding path program 1 times [2025-03-04 07:41:25,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:25,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565068597] [2025-03-04 07:41:25,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:25,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:25,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:41:25,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:41:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565068597] [2025-03-04 07:41:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565068597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285547377] [2025-03-04 07:41:25,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:25,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:25,512 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:25,514 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:25,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:25,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:41:25,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:41:25,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:25,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:25,662 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:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:41:25,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:25,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285547377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:25,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2025-03-04 07:41:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456858470] [2025-03-04 07:41:25,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:25,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:41:25,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:25,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:41:25,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:41:25,897 INFO L87 Difference]: Start difference. First operand 256 states and 290 transitions. Second operand has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:26,193 INFO L93 Difference]: Finished difference Result 267 states and 295 transitions. [2025-03-04 07:41:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:41:26,194 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2025-03-04 07:41:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:26,194 INFO L225 Difference]: With dead ends: 267 [2025-03-04 07:41:26,195 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 07:41:26,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:41:26,195 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 309 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:26,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 212 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 07:41:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 255. [2025-03-04 07:41:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 242 states have internal predecessors, (269), 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:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 284 transitions. [2025-03-04 07:41:26,199 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 284 transitions. Word has length 52 [2025-03-04 07:41:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:26,199 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 284 transitions. [2025-03-04 07:41:26,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 284 transitions. [2025-03-04 07:41:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 07:41:26,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:26,199 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, 1, 1, 1] [2025-03-04 07:41:26,207 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:41:26,399 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,SelfDestructingSolverStorable25 [2025-03-04 07:41:26,400 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:26,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1799931222, now seen corresponding path program 1 times [2025-03-04 07:41:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634295418] [2025-03-04 07:41:26,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:26,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:41:26,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:41:26,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:26,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:26,630 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:26,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:26,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634295418] [2025-03-04 07:41:26,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634295418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:26,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100441662] [2025-03-04 07:41:26,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:26,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:26,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:26,635 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:26,638 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:26,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:41:26,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:41:26,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:26,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:26,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:41:26,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:26,769 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:26,770 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:26,849 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (= |c_#valid| (store (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| 1) |c_old(~global~0.base)| (select |c_#valid| |c_old(~global~0.base)|)))) is different from true [2025-03-04 07:41:26,871 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2025-03-04 07:41:26,872 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 2 case distinctions, treesize of input 17 treesize of output 18 [2025-03-04 07:41:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-03-04 07:41:26,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100441662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:27,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:27,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-03-04 07:41:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164571622] [2025-03-04 07:41:27,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:27,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:41:27,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:27,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:41:27,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=375, Unknown=1, NotChecked=40, Total=506 [2025-03-04 07:41:27,113 INFO L87 Difference]: Start difference. First operand 255 states and 284 transitions. Second operand has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 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:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:27,472 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2025-03-04 07:41:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:41:27,473 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 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 54 [2025-03-04 07:41:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:27,474 INFO L225 Difference]: With dead ends: 263 [2025-03-04 07:41:27,474 INFO L226 Difference]: Without dead ends: 263 [2025-03-04 07:41:27,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=296, Invalid=829, Unknown=1, NotChecked=64, Total=1190 [2025-03-04 07:41:27,474 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 326 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:27,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 249 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 296 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2025-03-04 07:41:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-04 07:41:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2025-03-04 07:41:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 235 states have (on average 1.1404255319148937) internal successors, (268), 241 states have internal predecessors, (268), 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:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2025-03-04 07:41:27,477 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 54 [2025-03-04 07:41:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:27,478 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2025-03-04 07:41:27,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 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:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2025-03-04 07:41:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 07:41:27,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:27,479 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1] [2025-03-04 07:41:27,485 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:27,679 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,SelfDestructingSolverStorable26 [2025-03-04 07:41:27,681 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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:27,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash -498265877, now seen corresponding path program 1 times [2025-03-04 07:41:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:27,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041959001] [2025-03-04 07:41:27,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:27,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:27,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:41:27,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:41:27,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:27,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041959001] [2025-03-04 07:41:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041959001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901671842] [2025-03-04 07:41:28,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:28,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:28,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:28,053 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:28,055 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:28,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:41:28,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:41:28,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:28,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:28,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:41:28,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:28,385 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 07:41:28,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-04 07:41:28,799 INFO L349 Elim1Store]: treesize reduction 86, result has 22.5 percent of original size [2025-03-04 07:41:28,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 45 treesize of output 83 [2025-03-04 07:41:28,861 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-03-04 07:41:28,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2025-03-04 07:41:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:29,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:29,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901671842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:29,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:29,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 27 [2025-03-04 07:41:29,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942193001] [2025-03-04 07:41:29,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:29,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:41:29,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:29,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:41:29,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:41:29,168 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand has 29 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:30,293 INFO L93 Difference]: Finished difference Result 268 states and 295 transitions. [2025-03-04 07:41:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 07:41:30,294 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 60 [2025-03-04 07:41:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:30,294 INFO L225 Difference]: With dead ends: 268 [2025-03-04 07:41:30,294 INFO L226 Difference]: Without dead ends: 268 [2025-03-04 07:41:30,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=529, Invalid=2551, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 07:41:30,295 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 422 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:30,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 295 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:41:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-04 07:41:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2025-03-04 07:41:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 235 states have (on average 1.1361702127659574) internal successors, (267), 240 states have internal predecessors, (267), 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,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 282 transitions. [2025-03-04 07:41:30,301 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 282 transitions. Word has length 60 [2025-03-04 07:41:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:30,301 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 282 transitions. [2025-03-04 07:41:30,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 282 transitions. [2025-03-04 07:41:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 07:41:30,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:30,305 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, 1, 1, 1] [2025-03-04 07:41:30,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:30,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:30,505 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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:30,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1733627017, now seen corresponding path program 1 times [2025-03-04 07:41:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:30,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542475783] [2025-03-04 07:41:30,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:30,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 07:41:30,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 07:41:30,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:30,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:30,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:30,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542475783] [2025-03-04 07:41:30,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542475783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:30,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001906273] [2025-03-04 07:41:30,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:30,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:30,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:30,934 INFO L229 MonitoredProcess]: Starting monitored process 21 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,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 07:41:30,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 07:41:31,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 07:41:31,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:31,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:31,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:41:31,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:31,285 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:41:31,286 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 17 treesize of output 21 [2025-03-04 07:41:31,289 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:31,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:31,496 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:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 07:41:31,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001906273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:31,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:31,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 24 [2025-03-04 07:41:31,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874932718] [2025-03-04 07:41:31,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:31,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:41:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:31,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:41:31,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:41:31,802 INFO L87 Difference]: Start difference. First operand 253 states and 282 transitions. Second operand has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:32,663 INFO L93 Difference]: Finished difference Result 285 states and 311 transitions. [2025-03-04 07:41:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 07:41:32,664 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 61 [2025-03-04 07:41:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:32,664 INFO L225 Difference]: With dead ends: 285 [2025-03-04 07:41:32,664 INFO L226 Difference]: Without dead ends: 285 [2025-03-04 07:41:32,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=538, Invalid=2432, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 07:41:32,665 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 421 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:32,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 248 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-04 07:41:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 252. [2025-03-04 07:41:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 235 states have (on average 1.1319148936170214) internal successors, (266), 239 states have internal predecessors, (266), 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:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2025-03-04 07:41:32,669 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 61 [2025-03-04 07:41:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:32,669 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2025-03-04 07:41:32,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2025-03-04 07:41:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:41:32,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:32,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:32,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 07:41:32,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 07:41:32,874 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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:32,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:32,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2026065300, now seen corresponding path program 1 times [2025-03-04 07:41:32,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:32,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843487473] [2025-03-04 07:41:32,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:32,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:32,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:41:32,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:41:32,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:32,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:33,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843487473] [2025-03-04 07:41:33,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843487473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874821908] [2025-03-04 07:41:33,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:33,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:33,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:33,023 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:41:33,024 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:41:33,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:41:33,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:41:33,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:33,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:33,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:41:33,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:33,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:41:33,240 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:33,240 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 3 case distinctions, treesize of input 22 treesize of output 16 [2025-03-04 07:41:33,262 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:41:33,262 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:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:33,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:33,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874821908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:33,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:33,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-04 07:41:33,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919113414] [2025-03-04 07:41:33,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:33,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:41:33,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:33,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:41:33,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:41:33,325 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:41:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:33,454 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2025-03-04 07:41:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:41:33,454 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-03-04 07:41:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:33,455 INFO L225 Difference]: With dead ends: 263 [2025-03-04 07:41:33,455 INFO L226 Difference]: Without dead ends: 263 [2025-03-04 07:41:33,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:41:33,456 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 20 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:33,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 218 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-04 07:41:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 207. [2025-03-04 07:41:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 07:41:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 231 transitions. [2025-03-04 07:41:33,459 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 231 transitions. Word has length 66 [2025-03-04 07:41:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:33,459 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 231 transitions. [2025-03-04 07:41:33,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:41:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 231 transitions. [2025-03-04 07:41:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 07:41:33,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:33,460 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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:33,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:33,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:33,661 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash -168544402, now seen corresponding path program 1 times [2025-03-04 07:41:33,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:33,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632097744] [2025-03-04 07:41:33,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:33,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 07:41:33,681 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,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:33,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:41:33,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:41:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 07:41:33,692 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,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:33,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:41:33,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:41:33,713 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:41:33,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-03-04 07:41:33,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE (18 of 20 remaining) [2025-03-04 07:41:33,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE (17 of 20 remaining) [2025-03-04 07:41:33,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (16 of 20 remaining) [2025-03-04 07:41:33,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_FREE (15 of 20 remaining) [2025-03-04 07:41:33,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_FREE (14 of 20 remaining) [2025-03-04 07:41:33,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE (13 of 20 remaining) [2025-03-04 07:41:33,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6ASSERT_VIOLATIONMEMORY_FREE (12 of 20 remaining) [2025-03-04 07:41:33,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE (11 of 20 remaining) [2025-03-04 07:41:33,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE (10 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 20 remaining) [2025-03-04 07:41:33,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 20 remaining) [2025-03-04 07:41:33,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 07:41:33,718 INFO L422 BasicCegarLoop]: Path program histogram: [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:33,777 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:41:33,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:41:33 BoogieIcfgContainer [2025-03-04 07:41:33,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:41:33,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:41:33,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:41:33,780 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:41:33,780 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:33,782 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:41:33,782 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:41:33,783 INFO L158 Benchmark]: Toolchain (without parser) took 26740.14ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 121.5MB in the beginning and 240.9MB in the end (delta: -119.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2025-03-04 07:41:33,783 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:33,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.52ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 101.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:33,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.14ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 99.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:41:33,783 INFO L158 Benchmark]: Boogie Preprocessor took 34.81ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 97.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:33,783 INFO L158 Benchmark]: IcfgBuilder took 326.47ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 80.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:33,783 INFO L158 Benchmark]: TraceAbstraction took 25974.46ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 80.3MB in the beginning and 241.0MB in the end (delta: -160.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:33,783 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 293.6MB. Free memory was 241.0MB in the beginning and 240.9MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:41:33,784 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.52ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 101.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.14ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 99.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.81ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 97.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 326.47ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 80.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25974.46ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 80.3MB in the beginning and 241.0MB in the end (delta: -160.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 293.6MB. Free memory was 241.0MB in the beginning and 240.9MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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={7:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L722] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L723] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4: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)={4:0}, \old(state)=1, commands={6:0}, global={7: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={7: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={7: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={7: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={7:0}, i=0, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4: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)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={4:0}, state=1] [L692] COND FALSE !(i < 2) [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 FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, 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=1, 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=1, 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=1, 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=1, 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=1, input={5:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={5:0}, state=1] [L692] COND FALSE !(i < 2) [L724] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={7: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: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: 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: 25.9s, OverallIterations: 31, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5384 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5384 mSDsluCounter, 6301 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 239 IncrementalHoareTripleChecker+Unchecked, 4923 mSDsCounter, 639 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5970 IncrementalHoareTripleChecker+Invalid, 6848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 639 mSolverCounterUnsat, 1378 mSDtfsCounter, 5970 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1673 GetRequests, 1125 SyntacticMatches, 13 SemanticMatches, 535 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3841 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=9, InterpolantAutomatonStates: 299, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 605 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 1855 NumberOfCodeBlocks, 1855 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2000 ConstructedInterpolants, 123 QuantifiedInterpolants, 22865 SizeOfPredicates, 84 NumberOfNonLiveVariables, 5374 ConjunctsInSsa, 424 ConjunctsInUnsatCore, 59 InterpolantComputations, 11 PerfectInterpolantSequences, 371/993 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:33,802 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_2.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 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:41:35,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:35,711 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,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:35,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:35,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:35,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:35,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:35,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:35,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:35,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:35,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:35,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:35,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:35,746 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:35,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:35,746 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:35,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:35,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:35,747 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:35,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:35,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:35,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:35,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:35,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:35,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:35,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:35,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:35,749 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:41:35,749 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:41:35,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:35,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:35,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:35,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:35,749 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2025-03-04 07:41:35,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:35,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:35,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:35,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:35,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:35,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-03-04 07:41:37,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309b3880b/fd471aeb34234c1f8bf16ae7e864a422/FLAGfc2792feb [2025-03-04 07:41:37,417 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:37,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-03-04 07:41:37,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309b3880b/fd471aeb34234c1f8bf16ae7e864a422/FLAGfc2792feb [2025-03-04 07:41:37,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309b3880b/fd471aeb34234c1f8bf16ae7e864a422 [2025-03-04 07:41:37,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:37,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:37,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:37,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:37,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:37,736 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,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d6b7e8 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,738 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,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:37,940 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:37,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:37,953 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:41:37,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:38,018 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:41:38,019 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,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:38,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:38,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:41:38,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:41:38,025 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,035 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,048 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 93 [2025-03-04 07:41:38,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:38,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:41:38,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:41:38,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:41:38,054 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,054 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,060 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,070 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 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,070 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,070 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,083 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,084 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,084 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,085 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,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:41:38,092 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:41:38,092 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:41:38,092 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:41:38,092 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,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:38,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:38,128 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,130 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,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 07:41:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 07:41:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 07:41:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-03-04 07:41:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:41:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:41:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:41:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 07:41:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:41:38,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:41:38,249 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:41:38,251 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:41:38,462 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-04 07:41:38,462 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:41:38,468 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:41:38,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:41:38,468 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,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:41:38,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:41:38,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:41:38,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:41:38,473 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,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2307b8cf 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,474 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,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2307b8cf 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,474 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,475 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2025-03-04 07:41:38,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:38,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-03-04 07:41:38,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:38,513 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;@790ab348, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:38,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 07:41:38,516 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,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:38,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:38,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:38,520 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,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1396543346, now seen corresponding path program 1 times [2025-03-04 07:41:38,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:38,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112735013] [2025-03-04 07:41:38,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:38,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:38,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:38,532 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,534 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,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:38,600 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,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:38,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:38,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:38,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:38,696 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:38,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:38,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:38,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112735013] [2025-03-04 07:41:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112735013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:38,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:38,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:38,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161230844] [2025-03-04 07:41:38,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:38,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:38,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:38,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:38,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:38,725 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:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:38,838 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2025-03-04 07:41:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:38,840 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:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:38,844 INFO L225 Difference]: With dead ends: 110 [2025-03-04 07:41:38,845 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 07:41:38,846 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:38,848 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 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:38,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 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:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 07:41:38,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2025-03-04 07:41:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 76 states have internal predecessors, (97), 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:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2025-03-04 07:41:38,876 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 6 [2025-03-04 07:41:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:38,876 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2025-03-04 07:41:38,876 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:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2025-03-04 07:41:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:38,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:38,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:38,883 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,077 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,078 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,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:39,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1396543345, now seen corresponding path program 1 times [2025-03-04 07:41:39,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:39,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575989674] [2025-03-04 07:41:39,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:39,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:39,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:39,088 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,088 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,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:39,142 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,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:39,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:41:39,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:39,239 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,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:39,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575989674] [2025-03-04 07:41:39,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575989674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:39,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:39,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:39,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043761704] [2025-03-04 07:41:39,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:39,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:39,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:39,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:39,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:39,241 INFO L87 Difference]: Start difference. First operand 84 states and 110 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,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:39,380 INFO L93 Difference]: Finished difference Result 180 states and 242 transitions. [2025-03-04 07:41:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:39,380 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,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:39,381 INFO L225 Difference]: With dead ends: 180 [2025-03-04 07:41:39,381 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 07:41:39,382 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,382 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 86 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 139 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,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 139 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,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 07:41:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2025-03-04 07:41:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.7394957983193278) internal successors, (207), 138 states have internal predecessors, (207), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-04 07:41:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 238 transitions. [2025-03-04 07:41:39,401 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 238 transitions. Word has length 6 [2025-03-04 07:41:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:39,402 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 238 transitions. [2025-03-04 07:41:39,402 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,402 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 238 transitions. [2025-03-04 07:41:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:41:39,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:39,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:39,410 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,602 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,603 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,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash -343170744, now seen corresponding path program 1 times [2025-03-04 07:41:39,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:39,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138299586] [2025-03-04 07:41:39,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:39,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:39,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:39,606 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,607 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,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:41:39,656 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,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:39,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:39,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:39,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:39,746 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,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:39,746 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:39,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138299586] [2025-03-04 07:41:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138299586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:39,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:39,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:39,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782977629] [2025-03-04 07:41:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:39,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:39,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:39,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:39,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:39,748 INFO L87 Difference]: Start difference. First operand 152 states and 238 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:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:39,918 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-03-04 07:41:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:39,919 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:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:39,924 INFO L225 Difference]: With dead ends: 192 [2025-03-04 07:41:39,924 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 07:41:39,924 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:39,925 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 159 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:39,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 159 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:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 07:41:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2025-03-04 07:41:39,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.721311475409836) internal successors, (210), 141 states have internal predecessors, (210), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-04 07:41:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2025-03-04 07:41:39,934 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 7 [2025-03-04 07:41:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:39,934 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2025-03-04 07:41:39,934 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:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2025-03-04 07:41:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:41:39,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:39,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:39,945 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,135 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,135 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,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2048358452, now seen corresponding path program 1 times [2025-03-04 07:41:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:40,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850059511] [2025-03-04 07:41:40,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:40,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:40,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:40,139 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,140 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,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:41:40,194 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,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:40,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:40,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:41:40,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:40,319 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,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:40,319 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:40,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850059511] [2025-03-04 07:41:40,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850059511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:40,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:40,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758041782] [2025-03-04 07:41:40,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:40,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:40,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:40,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:40,321 INFO L87 Difference]: Start difference. First operand 155 states and 241 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,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:40,489 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2025-03-04 07:41:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:40,490 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,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:40,491 INFO L225 Difference]: With dead ends: 182 [2025-03-04 07:41:40,491 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 07:41:40,491 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,491 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 68 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:40,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 205 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 07:41:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 155. [2025-03-04 07:41:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.7049180327868851) internal successors, (208), 141 states have internal predecessors, (208), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-04 07:41:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2025-03-04 07:41:40,506 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 8 [2025-03-04 07:41:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:40,506 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2025-03-04 07:41:40,507 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,507 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2025-03-04 07:41:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:41:40,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:40,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:40,515 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:40,708 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:40,709 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:40,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:40,709 INFO L85 PathProgramCache]: Analyzing trace with hash 925397446, now seen corresponding path program 1 times [2025-03-04 07:41:40,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:40,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2021785660] [2025-03-04 07:41:40,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:40,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:40,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:40,712 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:40,712 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:40,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:40,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:41:40,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:40,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:40,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:41:40,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:40,803 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,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:40,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021785660] [2025-03-04 07:41:40,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021785660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:40,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:40,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104873653] [2025-03-04 07:41:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:40,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:40,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:40,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:40,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:40,805 INFO L87 Difference]: Start difference. First operand 155 states and 239 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:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:40,920 INFO L93 Difference]: Finished difference Result 234 states and 321 transitions. [2025-03-04 07:41:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:40,920 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:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:40,921 INFO L225 Difference]: With dead ends: 234 [2025-03-04 07:41:40,921 INFO L226 Difference]: Without dead ends: 234 [2025-03-04 07:41:40,921 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:40,922 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 172 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:40,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 170 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-04 07:41:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 191. [2025-03-04 07:41:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.6538461538461537) internal successors, (258), 176 states have internal predecessors, (258), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-04 07:41:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 289 transitions. [2025-03-04 07:41:40,930 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 289 transitions. Word has length 9 [2025-03-04 07:41:40,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:40,930 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 289 transitions. [2025-03-04 07:41:40,930 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:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 289 transitions. [2025-03-04 07:41:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:40,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:40,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:40,936 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,135 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,135 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,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:41,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1377450230, now seen corresponding path program 1 times [2025-03-04 07:41:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:41,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26876194] [2025-03-04 07:41:41,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:41,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:41,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:41,138 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,138 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,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:41,190 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,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:41,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:41,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:41,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:41,271 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,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:41,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26876194] [2025-03-04 07:41:41,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26876194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:41,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848020898] [2025-03-04 07:41:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:41,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:41,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:41,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:41,272 INFO L87 Difference]: Start difference. First operand 191 states and 289 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,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:41,391 INFO L93 Difference]: Finished difference Result 231 states and 304 transitions. [2025-03-04 07:41:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:41,392 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,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:41,393 INFO L225 Difference]: With dead ends: 231 [2025-03-04 07:41:41,393 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 07:41:41,393 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,393 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 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,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 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,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 07:41:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 201. [2025-03-04 07:41:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.6424242424242423) internal successors, (271), 186 states have internal predecessors, (271), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-04 07:41:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2025-03-04 07:41:41,406 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 10 [2025-03-04 07:41:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:41,406 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2025-03-04 07:41:41,406 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,406 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2025-03-04 07:41:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:41:41,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:41,407 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:41,413 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:41,607 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:41,607 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:41,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash 675125788, now seen corresponding path program 1 times [2025-03-04 07:41:41,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:41,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713832404] [2025-03-04 07:41:41,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:41,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:41,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:41,610 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:41,610 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:41,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:41,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:41:41,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:41,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:41,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:41,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:41,784 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:41,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:41,933 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:41,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:41,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713832404] [2025-03-04 07:41:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713832404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:41,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:41,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-04 07:41:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818158179] [2025-03-04 07:41:41,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:41,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:41:41,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:41,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:41:41,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:41,934 INFO L87 Difference]: Start difference. First operand 201 states and 302 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,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:42,205 INFO L93 Difference]: Finished difference Result 269 states and 359 transitions. [2025-03-04 07:41:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:42,208 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,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:42,209 INFO L225 Difference]: With dead ends: 269 [2025-03-04 07:41:42,209 INFO L226 Difference]: Without dead ends: 269 [2025-03-04 07:41:42,209 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,209 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 132 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:42,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 321 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-04 07:41:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2025-03-04 07:41:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 195 states have (on average 1.6358974358974359) internal successors, (319), 216 states have internal predecessors, (319), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-04 07:41:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 350 transitions. [2025-03-04 07:41:42,218 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 350 transitions. Word has length 14 [2025-03-04 07:41:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:42,218 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 350 transitions. [2025-03-04 07:41:42,218 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,218 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 350 transitions. [2025-03-04 07:41:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:41:42,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:42,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:42,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:41:42,420 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,420 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,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash -545937061, now seen corresponding path program 1 times [2025-03-04 07:41:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:42,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402419210] [2025-03-04 07:41:42,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:42,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:42,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:42,423 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,424 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,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:42,468 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,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:42,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:42,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:42,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:42,707 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:42,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:42,993 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:42,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:42,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402419210] [2025-03-04 07:41:42,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402419210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:42,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:42,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-04 07:41:42,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555886225] [2025-03-04 07:41:42,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:42,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:41:42,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:42,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:41:42,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:42,995 INFO L87 Difference]: Start difference. First operand 231 states and 350 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,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:44,126 INFO L93 Difference]: Finished difference Result 353 states and 485 transitions. [2025-03-04 07:41:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:41:44,127 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,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:44,128 INFO L225 Difference]: With dead ends: 353 [2025-03-04 07:41:44,128 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 07:41:44,128 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,129 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 324 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:44,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 315 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:41:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 07:41:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 269. [2025-03-04 07:41:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 233 states have (on average 1.6351931330472103) internal successors, (381), 254 states have internal predecessors, (381), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-04 07:41:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2025-03-04 07:41:44,139 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 15 [2025-03-04 07:41:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:44,139 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2025-03-04 07:41:44,139 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,139 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2025-03-04 07:41:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:41:44,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:44,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:44,146 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,340 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,340 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,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash 255820313, now seen corresponding path program 1 times [2025-03-04 07:41:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:44,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389473185] [2025-03-04 07:41:44,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:44,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:44,343 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,344 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,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:41:44,394 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,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:44,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:44,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:44,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:44,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:44,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:44,941 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:44,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:44,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389473185] [2025-03-04 07:41:44,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389473185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:44,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:44,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-04 07:41:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478243533] [2025-03-04 07:41:44,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:44,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:41:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:44,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:41:44,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:44,942 INFO L87 Difference]: Start difference. First operand 269 states and 412 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,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:46,050 INFO L93 Difference]: Finished difference Result 492 states and 681 transitions. [2025-03-04 07:41:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:41:46,051 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,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:46,053 INFO L225 Difference]: With dead ends: 492 [2025-03-04 07:41:46,053 INFO L226 Difference]: Without dead ends: 492 [2025-03-04 07:41:46,053 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,053 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 369 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:46,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 341 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:41:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-04 07:41:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 371. [2025-03-04 07:41:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 352 states have internal predecessors, (552), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 07:41:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 594 transitions. [2025-03-04 07:41:46,067 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 594 transitions. Word has length 16 [2025-03-04 07:41:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:46,067 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 594 transitions. [2025-03-04 07:41:46,067 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,067 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 594 transitions. [2025-03-04 07:41:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:46,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:46,068 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,075 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,269 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,269 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash -104700271, now seen corresponding path program 1 times [2025-03-04 07:41:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:46,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626115335] [2025-03-04 07:41:46,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:46,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:46,272 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,272 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,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:46,318 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,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:46,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:46,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:41:46,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:46,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:46,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:46,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:46,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626115335] [2025-03-04 07:41:46,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626115335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:46,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:46,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:46,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888622727] [2025-03-04 07:41:46,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:46,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:46,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:46,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:46,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:46,330 INFO L87 Difference]: Start difference. First operand 371 states and 594 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:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:46,339 INFO L93 Difference]: Finished difference Result 370 states and 590 transitions. [2025-03-04 07:41:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:46,339 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:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:46,341 INFO L225 Difference]: With dead ends: 370 [2025-03-04 07:41:46,341 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 07:41:46,341 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,342 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:46,342 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:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 07:41:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-04 07:41:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 331 states have (on average 1.6555891238670695) internal successors, (548), 351 states have internal predecessors, (548), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 07:41:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 590 transitions. [2025-03-04 07:41:46,353 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 590 transitions. Word has length 18 [2025-03-04 07:41:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:46,354 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 590 transitions. [2025-03-04 07:41:46,354 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:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 590 transitions. [2025-03-04 07:41:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:41:46,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:46,354 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:46,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:41:46,555 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,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1049689854, now seen corresponding path program 1 times [2025-03-04 07:41:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591300099] [2025-03-04 07:41:46,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:46,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:46,557 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,558 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,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:41:46,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:41:46,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:46,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:46,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:46,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:46,632 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,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:46,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591300099] [2025-03-04 07:41:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591300099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:46,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:46,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786477111] [2025-03-04 07:41:46,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:46,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:46,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:46,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:46,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:46,633 INFO L87 Difference]: Start difference. First operand 370 states and 590 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:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:46,650 INFO L93 Difference]: Finished difference Result 512 states and 817 transitions. [2025-03-04 07:41:46,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:46,651 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:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:46,652 INFO L225 Difference]: With dead ends: 512 [2025-03-04 07:41:46,652 INFO L226 Difference]: Without dead ends: 512 [2025-03-04 07:41:46,652 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:46,653 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 112 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,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 112 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,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-04 07:41:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 497. [2025-03-04 07:41:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 449 states have (on average 1.6547884187082404) internal successors, (743), 471 states have internal predecessors, (743), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2025-03-04 07:41:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 815 transitions. [2025-03-04 07:41:46,664 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 815 transitions. Word has length 19 [2025-03-04 07:41:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:46,664 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 815 transitions. [2025-03-04 07:41:46,664 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:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 815 transitions. [2025-03-04 07:41:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:41:46,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:46,665 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:46,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:46,865 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:46,866 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:46,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:46,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1049258878, now seen corresponding path program 1 times [2025-03-04 07:41:46,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:46,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1741511451] [2025-03-04 07:41:46,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:46,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:46,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:46,868 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:46,870 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:46,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:41:46,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:41:46,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:46,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:46,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:41:46,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:46,922 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,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:46,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:46,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741511451] [2025-03-04 07:41:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741511451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504574129] [2025-03-04 07:41:46,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:46,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:46,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:46,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:46,923 INFO L87 Difference]: Start difference. First operand 497 states and 815 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:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:46,928 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2025-03-04 07:41:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:46,928 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:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:46,930 INFO L225 Difference]: With dead ends: 356 [2025-03-04 07:41:46,930 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 07:41:46,930 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:46,930 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:46,930 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:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 07:41:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-04 07:41:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 320 states have (on average 1.58125) internal successors, (506), 335 states have internal predecessors, (506), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-03-04 07:41:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 554 transitions. [2025-03-04 07:41:46,939 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 554 transitions. Word has length 19 [2025-03-04 07:41:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:46,939 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 554 transitions. [2025-03-04 07:41:46,939 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:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 554 transitions. [2025-03-04 07:41:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:41:46,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:46,940 INFO L218 NwaCegarLoop]: trace histogram [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:46,949 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,140 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,140 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1819352899, now seen corresponding path program 1 times [2025-03-04 07:41:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:47,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633924070] [2025-03-04 07:41:47,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:47,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:47,146 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,147 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,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:41:47,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:41:47,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:47,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:47,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:47,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:47,225 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,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:47,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:47,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633924070] [2025-03-04 07:41:47,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633924070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:47,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:47,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029898997] [2025-03-04 07:41:47,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:47,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:47,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:47,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:47,226 INFO L87 Difference]: Start difference. First operand 356 states and 554 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:47,248 INFO L93 Difference]: Finished difference Result 328 states and 476 transitions. [2025-03-04 07:41:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:47,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20 [2025-03-04 07:41:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:47,250 INFO L225 Difference]: With dead ends: 328 [2025-03-04 07:41:47,250 INFO L226 Difference]: Without dead ends: 326 [2025-03-04 07:41:47,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:47,252 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:47,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-04 07:41:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 315. [2025-03-04 07:41:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 282 states have (on average 1.5390070921985815) internal successors, (434), 297 states have internal predecessors, (434), 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:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2025-03-04 07:41:47,259 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 20 [2025-03-04 07:41:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:47,259 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2025-03-04 07:41:47,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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,259 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2025-03-04 07:41:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:41:47,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:47,260 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 07:41:47,267 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:47,461 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,462 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,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1741625687, now seen corresponding path program 2 times [2025-03-04 07:41:47,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:47,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084602511] [2025-03-04 07:41:47,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:47,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:47,465 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,466 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,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 07:41:47,511 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,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:47,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:47,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:47,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:47,540 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,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:47,576 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,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:47,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084602511] [2025-03-04 07:41:47,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084602511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:47,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:47,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 07:41:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491707101] [2025-03-04 07:41:47,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:47,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:41:47,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:47,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:41:47,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:47,577 INFO L87 Difference]: Start difference. First operand 315 states and 470 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:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:47,640 INFO L93 Difference]: Finished difference Result 282 states and 393 transitions. [2025-03-04 07:41:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:47,641 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:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:47,641 INFO L225 Difference]: With dead ends: 282 [2025-03-04 07:41:47,642 INFO L226 Difference]: Without dead ends: 282 [2025-03-04 07:41:47,642 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:47,642 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:47,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 252 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-04 07:41:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2025-03-04 07:41:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 235 states have (on average 1.4638297872340424) internal successors, (344), 250 states have internal predecessors, (344), 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:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 380 transitions. [2025-03-04 07:41:47,647 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 380 transitions. Word has length 22 [2025-03-04 07:41:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:47,647 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 380 transitions. [2025-03-04 07:41:47,648 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:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 380 transitions. [2025-03-04 07:41:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:41:47,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:47,648 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:47,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:47,848 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:47,849 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:47,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:47,849 INFO L85 PathProgramCache]: Analyzing trace with hash 873060588, now seen corresponding path program 1 times [2025-03-04 07:41:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:47,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132698981] [2025-03-04 07:41:47,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:47,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:47,852 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:47,852 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:47,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:41:47,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:41:47,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:47,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:47,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:41:47,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:47,904 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:47,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:47,904 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132698981] [2025-03-04 07:41:47,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132698981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:47,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:47,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:47,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601722392] [2025-03-04 07:41:47,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:47,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:47,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:47,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:47,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:47,905 INFO L87 Difference]: Start difference. First operand 268 states and 380 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:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:47,913 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2025-03-04 07:41:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:47,914 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:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:47,914 INFO L225 Difference]: With dead ends: 197 [2025-03-04 07:41:47,914 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 07:41:47,914 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:47,915 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 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:47,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 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:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 07:41:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-04 07:41:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 170 states have (on average 1.4294117647058824) internal successors, (243), 184 states have internal predecessors, (243), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-04 07:41:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 265 transitions. [2025-03-04 07:41:47,934 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 265 transitions. Word has length 25 [2025-03-04 07:41:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:47,934 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 265 transitions. [2025-03-04 07:41:47,934 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:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 265 transitions. [2025-03-04 07:41:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:41:47,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:47,934 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:47,942 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,134 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,135 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,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2088925211, now seen corresponding path program 1 times [2025-03-04 07:41:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:48,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300417355] [2025-03-04 07:41:48,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:48,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:48,137 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,138 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,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:48,187 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,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:48,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:48,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:48,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:48,313 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:41:48,313 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:48,430 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:48,461 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:48,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:48,571 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-03-04 07:41:48,572 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,028 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-03-04 07:41:53,029 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,109 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,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:53,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300417355] [2025-03-04 07:41:53,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300417355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:53,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:53,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2025-03-04 07:41:53,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294607462] [2025-03-04 07:41:53,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:53,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:41:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:53,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:41:53,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2025-03-04 07:41:53,111 INFO L87 Difference]: Start difference. First operand 197 states and 265 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:42:19,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 26.78s 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:24,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s 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:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:24,473 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2025-03-04 07:42:24,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:42:24,473 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:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:24,474 INFO L225 Difference]: With dead ends: 220 [2025-03-04 07:42:24,474 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 07:42:24,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=119, Invalid=217, Unknown=6, NotChecked=0, Total=342 [2025-03-04 07:42:24,475 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 156 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 33 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:24,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 77 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 92 Invalid, 10 Unknown, 0 Unchecked, 30.1s Time] [2025-03-04 07:42:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 07:42:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2025-03-04 07:42:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 195 states have internal predecessors, (241), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-04 07:42:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 265 transitions. [2025-03-04 07:42:24,480 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 265 transitions. Word has length 27 [2025-03-04 07:42:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:24,480 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 265 transitions. [2025-03-04 07:42:24,481 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:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 265 transitions. [2025-03-04 07:42:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:42:24,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:24,481 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] [2025-03-04 07:42:24,489 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:42:24,681 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:42:24,682 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:24,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1809910584, now seen corresponding path program 1 times [2025-03-04 07:42:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:24,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320321491] [2025-03-04 07:42:24,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:24,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:24,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:24,684 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:42:24,686 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:42:24,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:42:24,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:42:24,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:24,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:24,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:42:24,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:25,501 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:25,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:26,496 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:26,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:26,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320321491] [2025-03-04 07:42:26,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320321491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:26,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:26,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 07:42:26,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122112765] [2025-03-04 07:42:26,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:26,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:42:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:26,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:42:26,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:42:26,497 INFO L87 Difference]: Start difference. First operand 208 states and 265 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:28,399 INFO L93 Difference]: Finished difference Result 313 states and 367 transitions. [2025-03-04 07:42:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:42:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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 28 [2025-03-04 07:42:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:28,400 INFO L225 Difference]: With dead ends: 313 [2025-03-04 07:42:28,400 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 07:42:28,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:42:28,401 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 216 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:28,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 213 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 07:42:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 07:42:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 280. [2025-03-04 07:42:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 250 states have (on average 1.296) internal successors, (324), 265 states have internal predecessors, (324), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 07:42:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 347 transitions. [2025-03-04 07:42:28,406 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 347 transitions. Word has length 28 [2025-03-04 07:42:28,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:28,406 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 347 transitions. [2025-03-04 07:42:28,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 347 transitions. [2025-03-04 07:42:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:42:28,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:28,407 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:28,414 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:28,607 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:28,607 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1707400798, now seen corresponding path program 1 times [2025-03-04 07:42:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659328677] [2025-03-04 07:42:28,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:28,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:28,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:28,610 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:28,611 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:28,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:42:28,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:42:28,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:28,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:28,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:42:28,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:30,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:30,850 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:31,627 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:31,627 INFO L312 TraceCheckSpWp]: Computing backward predicates...