./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cmemrchr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/array-memsafety/openbsd_cmemrchr-alloca-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 3a34687129125cc08371e7bb78f7bdb7a4f5274a9b22928fd388f593b6db6995 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:46:13,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:46:13,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:46:13,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:46:13,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:46:13,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:46:13,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:46:13,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:46:13,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:46:13,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:46:13,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:46:13,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:46:13,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:46:13,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:46:13,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:46:13,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:46:13,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:46:13,108 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 -> 3a34687129125cc08371e7bb78f7bdb7a4f5274a9b22928fd388f593b6db6995 [2025-03-17 11:46:13,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:46:13,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:46:13,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:46:13,370 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:46:13,370 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:46:13,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cmemrchr-alloca-2.i [2025-03-17 11:46:14,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8044fd546/7b8ba0113bc64d4f9cf6f31721d12ea1/FLAG86d605ddc [2025-03-17 11:46:14,756 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:46:14,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cmemrchr-alloca-2.i [2025-03-17 11:46:14,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8044fd546/7b8ba0113bc64d4f9cf6f31721d12ea1/FLAG86d605ddc [2025-03-17 11:46:15,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8044fd546/7b8ba0113bc64d4f9cf6f31721d12ea1 [2025-03-17 11:46:15,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:46:15,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:46:15,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:46:15,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:46:15,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:46:15,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30704e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15, skipping insertion in model container [2025-03-17 11:46:15,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:46:15,282 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-17 11:46:15,286 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-17 11:46:15,294 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-17 11:46:15,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:46:15,307 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:46:15,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:46:15,360 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:46:15,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15 WrapperNode [2025-03-17 11:46:15,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:46:15,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:46:15,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:46:15,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:46:15,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,392 INFO L138 Inliner]: procedures = 117, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2025-03-17 11:46:15,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:46:15,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:46:15,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:46:15,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:46:15,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,412 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-03-17 11:46:15,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:46:15,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:46:15,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:46:15,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:46:15,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (1/1) ... [2025-03-17 11:46:15,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:46:15,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:15,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:46:15,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:46:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:46:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:46:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:46:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:46:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:46:15,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:46:15,526 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:46:15,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:46:15,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L537: call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; [2025-03-17 11:46:15,633 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-17 11:46:15,633 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:46:15,640 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:46:15,641 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:46:15,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:46:15 BoogieIcfgContainer [2025-03-17 11:46:15,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:46:15,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:46:15,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:46:15,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:46:15,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:46:15" (1/3) ... [2025-03-17 11:46:15,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6897847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:46:15, skipping insertion in model container [2025-03-17 11:46:15,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:15" (2/3) ... [2025-03-17 11:46:15,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6897847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:46:15, skipping insertion in model container [2025-03-17 11:46:15,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:46:15" (3/3) ... [2025-03-17 11:46:15,649 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cmemrchr-alloca-2.i [2025-03-17 11:46:15,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:46:15,660 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cmemrchr-alloca-2.i that has 1 procedures, 22 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-03-17 11:46:15,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:46:15,698 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;@28ed669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:46:15,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 11:46:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.75) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:46:15,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:15,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:46:15,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1832203068, now seen corresponding path program 1 times [2025-03-17 11:46:15,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:15,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431095374] [2025-03-17 11:46:15,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:15,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:15,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:46:15,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:46:15,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:15,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:15,874 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-17 11:46:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431095374] [2025-03-17 11:46:15,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431095374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:15,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:15,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:46:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645058179] [2025-03-17 11:46:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:15,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:46:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:15,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:46:15,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:46:15,895 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.75) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:15,916 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2025-03-17 11:46:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:46:15,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:46:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:15,922 INFO L225 Difference]: With dead ends: 21 [2025-03-17 11:46:15,922 INFO L226 Difference]: Without dead ends: 19 [2025-03-17 11:46:15,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:46:15,924 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:15,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-17 11:46:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-17 11:46:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-17 11:46:15,947 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 6 [2025-03-17 11:46:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:15,947 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-17 11:46:15,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-03-17 11:46:15,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:46:15,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:15,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:46:15,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:46:15,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:15,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1832203069, now seen corresponding path program 1 times [2025-03-17 11:46:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868482452] [2025-03-17 11:46:15,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:15,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:46:15,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:46:15,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:15,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:16,174 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-17 11:46:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868482452] [2025-03-17 11:46:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868482452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:16,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:16,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:46:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269575548] [2025-03-17 11:46:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:16,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:46:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:16,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:46:16,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:16,176 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:16,241 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2025-03-17 11:46:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:46:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:46:16,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:16,242 INFO L225 Difference]: With dead ends: 27 [2025-03-17 11:46:16,242 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 11:46:16,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:46:16,242 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:16,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 11:46:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-03-17 11:46:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.5) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-17 11:46:16,245 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 6 [2025-03-17 11:46:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:16,245 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-17 11:46:16,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-03-17 11:46:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:46:16,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:16,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:46:16,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:46:16,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:16,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1832232860, now seen corresponding path program 1 times [2025-03-17 11:46:16,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:16,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354677892] [2025-03-17 11:46:16,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:16,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:16,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:46:16,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:46:16,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:16,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:16,401 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-17 11:46:16,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:16,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354677892] [2025-03-17 11:46:16,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354677892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:16,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:16,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:46:16,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337512680] [2025-03-17 11:46:16,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:16,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:46:16,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:16,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:46:16,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:46:16,402 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:16,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:16,451 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-17 11:46:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:46:16,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:46:16,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:16,452 INFO L225 Difference]: With dead ends: 25 [2025-03-17 11:46:16,452 INFO L226 Difference]: Without dead ends: 25 [2025-03-17 11:46:16,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:46:16,452 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:16,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 71 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-17 11:46:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-03-17 11:46:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-17 11:46:16,454 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 6 [2025-03-17 11:46:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:16,454 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 11:46:16,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-17 11:46:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:46:16,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:16,455 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:16,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:46:16,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:16,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1577773894, now seen corresponding path program 1 times [2025-03-17 11:46:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:16,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960265338] [2025-03-17 11:46:16,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:16,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:46:16,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:46:16,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:16,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960265338] [2025-03-17 11:46:16,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960265338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:16,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632090586] [2025-03-17 11:46:16,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:16,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:16,502 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-17 11:46:16,504 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-17 11:46:16,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:46:16,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:46:16,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:16,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:46:16,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:16,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:46:16,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632090586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:16,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:46:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 11:46:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567484980] [2025-03-17 11:46:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:16,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:46:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:16,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:46:16,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:46:16,595 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:16,620 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-03-17 11:46:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:46:16,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:46:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:16,621 INFO L225 Difference]: With dead ends: 26 [2025-03-17 11:46:16,621 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 11:46:16,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:46:16,622 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:16,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 11:46:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 11:46:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-03-17 11:46:16,624 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 9 [2025-03-17 11:46:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:16,624 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-03-17 11:46:16,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-03-17 11:46:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:46:16,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:16,625 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:16,632 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-17 11:46:16,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:16,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:16,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash -690270213, now seen corresponding path program 1 times [2025-03-17 11:46:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032254139] [2025-03-17 11:46:16,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:16,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:16,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:46:16,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:46:16,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:16,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:16,996 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-17 11:46:16,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:16,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032254139] [2025-03-17 11:46:16,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032254139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:16,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050685900] [2025-03-17 11:46:16,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:16,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:16,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:16,999 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-17 11:46:17,001 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-17 11:46:17,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:46:17,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:46:17,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:17,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:17,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 11:46:17,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:17,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-17 11:46:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:17,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:17,385 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-17 11:46:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050685900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:17,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-17 11:46:17,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920379600] [2025-03-17 11:46:17,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:17,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:46:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:17,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:46:17,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:46:17,388 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:17,497 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-03-17 11:46:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:46:17,498 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:46:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:17,498 INFO L225 Difference]: With dead ends: 26 [2025-03-17 11:46:17,498 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 11:46:17,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:46:17,499 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:17,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 11:46:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-17 11:46:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-17 11:46:17,501 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 9 [2025-03-17 11:46:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:17,501 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-17 11:46:17,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-03-17 11:46:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:46:17,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:17,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:17,509 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-17 11:46:17,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:17,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:17,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash -117410824, now seen corresponding path program 1 times [2025-03-17 11:46:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:17,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423429438] [2025-03-17 11:46:17,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:17,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:17,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:46:17,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:46:17,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:17,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423429438] [2025-03-17 11:46:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423429438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9660411] [2025-03-17 11:46:17,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:17,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:17,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:17,972 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-17 11:46:17,974 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-17 11:46:18,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:46:18,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:46:18,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:18,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:18,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:46:18,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:18,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:46:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:18,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:46:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9660411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:18,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:46:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-17 11:46:18,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783347606] [2025-03-17 11:46:18,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:18,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:46:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:18,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:46:18,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:46:18,122 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:18,158 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2025-03-17 11:46:18,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:46:18,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 11:46:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:18,159 INFO L225 Difference]: With dead ends: 27 [2025-03-17 11:46:18,159 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 11:46:18,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:46:18,159 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:18,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 11:46:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-17 11:46:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.375) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-17 11:46:18,161 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 11 [2025-03-17 11:46:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:18,161 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-17 11:46:18,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-17 11:46:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:46:18,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:18,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:18,167 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-17 11:46:18,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:18,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:18,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:18,366 INFO L85 PathProgramCache]: Analyzing trace with hash -117410825, now seen corresponding path program 1 times [2025-03-17 11:46:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:18,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059337533] [2025-03-17 11:46:18,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:18,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:46:18,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:46:18,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:18,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059337533] [2025-03-17 11:46:18,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059337533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:18,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:18,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:46:18,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446885587] [2025-03-17 11:46:18,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:18,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:46:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:18,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:46:18,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:46:18,424 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:18,461 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-03-17 11:46:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:46:18,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 11:46:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:18,462 INFO L225 Difference]: With dead ends: 29 [2025-03-17 11:46:18,462 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 11:46:18,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:46:18,462 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:18,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 54 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 11:46:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2025-03-17 11:46:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-03-17 11:46:18,466 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 11 [2025-03-17 11:46:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:18,466 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-03-17 11:46:18,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-03-17 11:46:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:46:18,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:18,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:18,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:46:18,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:18,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1924865287, now seen corresponding path program 1 times [2025-03-17 11:46:18,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:18,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332736594] [2025-03-17 11:46:18,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:18,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:18,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:46:18,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:46:18,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:18,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:18,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:18,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332736594] [2025-03-17 11:46:18,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332736594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:18,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:46:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275136273] [2025-03-17 11:46:18,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:18,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:46:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:18,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:46:18,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:46:18,754 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:18,806 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-03-17 11:46:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:46:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 11:46:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:18,807 INFO L225 Difference]: With dead ends: 28 [2025-03-17 11:46:18,807 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 11:46:18,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:46:18,807 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:18,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 11:46:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-17 11:46:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-03-17 11:46:18,809 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 11 [2025-03-17 11:46:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:18,809 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-03-17 11:46:18,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-03-17 11:46:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:46:18,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:18,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:18,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:46:18,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:18,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:18,812 INFO L85 PathProgramCache]: Analyzing trace with hash 458737096, now seen corresponding path program 1 times [2025-03-17 11:46:18,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:18,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998368640] [2025-03-17 11:46:18,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:18,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:18,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:46:18,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:46:18,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:18,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:18,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:18,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998368640] [2025-03-17 11:46:18,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998368640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:18,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:18,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:46:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574935322] [2025-03-17 11:46:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:18,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:46:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:18,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:46:18,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:18,872 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:18,889 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-03-17 11:46:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:46:18,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:46:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:18,890 INFO L225 Difference]: With dead ends: 28 [2025-03-17 11:46:18,890 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 11:46:18,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:18,891 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:18,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 11:46:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-17 11:46:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-17 11:46:18,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 12 [2025-03-17 11:46:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:18,892 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-17 11:46:18,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-17 11:46:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:46:18,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:18,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:18,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:46:18,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:18,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:18,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1682527726, now seen corresponding path program 1 times [2025-03-17 11:46:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938133611] [2025-03-17 11:46:18,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:18,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:18,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:46:18,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:46:18,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:18,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938133611] [2025-03-17 11:46:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938133611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:18,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:46:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6256210] [2025-03-17 11:46:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:18,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:46:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:18,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:46:18,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:18,987 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:19,001 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-17 11:46:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:46:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 11:46:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:19,002 INFO L225 Difference]: With dead ends: 24 [2025-03-17 11:46:19,002 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 11:46:19,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:19,002 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:19,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 31 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 11:46:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 11:46:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-17 11:46:19,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2025-03-17 11:46:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:19,004 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-17 11:46:19,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-17 11:46:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:46:19,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:19,004 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:19,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:46:19,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -618688977, now seen corresponding path program 1 times [2025-03-17 11:46:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:19,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360372758] [2025-03-17 11:46:19,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:19,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:19,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:46:19,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:46:19,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:19,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:19,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:19,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360372758] [2025-03-17 11:46:19,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360372758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:19,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:19,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:46:19,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222336445] [2025-03-17 11:46:19,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:19,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:46:19,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:19,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:46:19,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:19,098 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:19,117 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-03-17 11:46:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:46:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:46:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:19,118 INFO L225 Difference]: With dead ends: 26 [2025-03-17 11:46:19,118 INFO L226 Difference]: Without dead ends: 16 [2025-03-17 11:46:19,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:19,119 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:19,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-17 11:46:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-17 11:46:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-17 11:46:19,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 15 [2025-03-17 11:46:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:19,121 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-17 11:46:19,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-17 11:46:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:46:19,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:19,122 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:19,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:46:19,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:19,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash -912091984, now seen corresponding path program 1 times [2025-03-17 11:46:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:19,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237826600] [2025-03-17 11:46:19,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:19,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:46:19,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:46:19,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:19,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237826600] [2025-03-17 11:46:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237826600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495123832] [2025-03-17 11:46:19,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:19,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:19,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:19,232 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-17 11:46:19,234 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-17 11:46:19,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:46:19,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:46:19,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:19,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:19,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 11:46:19,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:19,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495123832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:19,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:19,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-17 11:46:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188381883] [2025-03-17 11:46:19,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:19,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:46:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:19,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:46:19,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:46:19,418 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:19,476 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-03-17 11:46:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:46:19,477 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:46:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:19,477 INFO L225 Difference]: With dead ends: 26 [2025-03-17 11:46:19,477 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 11:46:19,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:46:19,478 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:19,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 48 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 11:46:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-17 11:46:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-03-17 11:46:19,480 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2025-03-17 11:46:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:19,480 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-03-17 11:46:19,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-03-17 11:46:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:46:19,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:19,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:19,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:19,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:19,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1125836593, now seen corresponding path program 2 times [2025-03-17 11:46:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435042728] [2025-03-17 11:46:19,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:19,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 11:46:19,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:46:19,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:19,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:20,038 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-17 11:46:20,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435042728] [2025-03-17 11:46:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435042728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258151246] [2025-03-17 11:46:20,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:20,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:20,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:20,044 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-17 11:46:20,045 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-17 11:46:20,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 11:46:20,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:46:20,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:20,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:20,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 11:46:20,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:20,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:46:20,392 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-17 11:46:20,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258151246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:20,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-03-17 11:46:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527619272] [2025-03-17 11:46:20,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 11:46:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:20,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 11:46:20,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:46:20,838 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:21,155 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-03-17 11:46:21,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:46:21,156 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 11:46:21,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:21,156 INFO L225 Difference]: With dead ends: 32 [2025-03-17 11:46:21,156 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 11:46:21,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 11:46:21,157 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:21,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 63 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 11:46:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2025-03-17 11:46:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-17 11:46:21,159 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2025-03-17 11:46:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:21,159 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-17 11:46:21,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-17 11:46:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 11:46:21,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:21,160 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:21,165 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-17 11:46:21,364 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,SelfDestructingSolverStorable12 [2025-03-17 11:46:21,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:21,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash -538198808, now seen corresponding path program 3 times [2025-03-17 11:46:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:21,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510427763] [2025-03-17 11:46:21,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:46:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:21,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-03-17 11:46:21,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:46:21,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:46:21,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:46:21,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510427763] [2025-03-17 11:46:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510427763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727312637] [2025-03-17 11:46:21,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:46:21,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:21,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:21,741 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-17 11:46:21,743 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-17 11:46:21,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-03-17 11:46:21,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:46:21,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:46:21,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:21,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:46:21,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:21,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:22,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727312637] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:22,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:22,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-03-17 11:46:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383445234] [2025-03-17 11:46:22,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:22,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 11:46:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:22,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 11:46:22,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:46:22,099 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:22,580 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-03-17 11:46:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 11:46:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 11:46:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:22,581 INFO L225 Difference]: With dead ends: 41 [2025-03-17 11:46:22,581 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 11:46:22,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=1411, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 11:46:22,582 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:22,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:46:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 11:46:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-17 11:46:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-03-17 11:46:22,584 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 22 [2025-03-17 11:46:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:22,584 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-03-17 11:46:22,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-03-17 11:46:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 11:46:22,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:22,585 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:22,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:22,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:22,785 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:22,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1956535810, now seen corresponding path program 4 times [2025-03-17 11:46:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:22,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691314114] [2025-03-17 11:46:22,786 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:46:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:22,797 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-17 11:46:22,806 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:46:22,806 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:46:22,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:22,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:22,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691314114] [2025-03-17 11:46:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691314114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270083215] [2025-03-17 11:46:22,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:46:22,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:22,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:22,938 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-17 11:46:22,939 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-17 11:46:22,973 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-17 11:46:22,991 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:46:22,992 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:46:22,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:22,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 11:46:22,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:23,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270083215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:23,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:23,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-17 11:46:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105437563] [2025-03-17 11:46:23,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:23,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:46:23,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:23,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:46:23,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:46:23,192 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:23,318 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2025-03-17 11:46:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:46:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 11:46:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:23,319 INFO L225 Difference]: With dead ends: 48 [2025-03-17 11:46:23,319 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 11:46:23,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:46:23,320 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:23,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 191 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 11:46:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-17 11:46:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-03-17 11:46:23,321 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2025-03-17 11:46:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:23,321 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-03-17 11:46:23,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-03-17 11:46:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 11:46:23,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:23,322 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:23,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:23,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:23,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:23,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:23,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1569521985, now seen corresponding path program 5 times [2025-03-17 11:46:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:23,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371077457] [2025-03-17 11:46:23,524 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:46:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:23,529 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 5 equivalence classes. [2025-03-17 11:46:23,559 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:46:23,560 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 11:46:23,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371077457] [2025-03-17 11:46:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371077457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454449123] [2025-03-17 11:46:24,378 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:46:24,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:24,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:24,381 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-17 11:46:24,381 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-17 11:46:24,422 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 5 equivalence classes. [2025-03-17 11:46:24,449 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:46:24,449 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 11:46:24,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:24,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 11:46:24,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:24,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:46:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:25,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:26,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454449123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:26,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:26,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 14] total 48 [2025-03-17 11:46:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642537437] [2025-03-17 11:46:26,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:26,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-17 11:46:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:26,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-17 11:46:26,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2207, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 11:46:26,521 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 49 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:27,837 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2025-03-17 11:46:27,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 11:46:27,837 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.875) internal successors, (90), 49 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-17 11:46:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:27,837 INFO L225 Difference]: With dead ends: 55 [2025-03-17 11:46:27,837 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 11:46:27,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=271, Invalid=4019, Unknown=0, NotChecked=0, Total=4290 [2025-03-17 11:46:27,839 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:27,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 115 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:46:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 11:46:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2025-03-17 11:46:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-03-17 11:46:27,841 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2025-03-17 11:46:27,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:27,841 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-03-17 11:46:27,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.875) internal successors, (90), 49 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-03-17 11:46:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 11:46:27,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:27,841 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:27,847 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-17 11:46:28,046 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,SelfDestructingSolverStorable15 [2025-03-17 11:46:28,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:28,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash 523328886, now seen corresponding path program 6 times [2025-03-17 11:46:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:28,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680037351] [2025-03-17 11:46:28,046 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:46:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:28,052 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 5 equivalence classes. [2025-03-17 11:46:28,067 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:46:28,067 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 11:46:28,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:28,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:28,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680037351] [2025-03-17 11:46:28,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680037351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:28,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679565205] [2025-03-17 11:46:28,387 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:46:28,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:28,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:28,389 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-17 11:46:28,391 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-17 11:46:28,436 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 5 equivalence classes. [2025-03-17 11:46:28,478 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:46:28,478 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 11:46:28,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:28,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 11:46:28,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:28,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:28,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679565205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:28,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:28,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2025-03-17 11:46:28,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667324511] [2025-03-17 11:46:28,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:28,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:46:28,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:28,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:46:28,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:46:28,809 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:29,154 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2025-03-17 11:46:29,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:46:29,154 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 11:46:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:29,155 INFO L225 Difference]: With dead ends: 59 [2025-03-17 11:46:29,155 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 11:46:29,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 11:46:29,156 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:29,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 287 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:46:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 11:46:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-17 11:46:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-03-17 11:46:29,157 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 36 [2025-03-17 11:46:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:29,157 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-03-17 11:46:29,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-03-17 11:46:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 11:46:29,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:29,158 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:29,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:29,358 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,SelfDestructingSolverStorable16 [2025-03-17 11:46:29,358 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:29,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1608734101, now seen corresponding path program 7 times [2025-03-17 11:46:29,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:29,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122727438] [2025-03-17 11:46:29,359 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:46:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:29,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:46:29,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:46:29,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:29,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122727438] [2025-03-17 11:46:29,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122727438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186363352] [2025-03-17 11:46:29,885 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:46:29,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:29,887 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-17 11:46:29,889 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-17 11:46:29,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:46:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:46:29,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:29,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:29,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 11:46:29,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:29,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-17 11:46:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:30,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 35 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:31,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186363352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:31,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 46 [2025-03-17 11:46:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416475730] [2025-03-17 11:46:31,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:31,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-17 11:46:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:31,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-17 11:46:31,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2002, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 11:46:31,427 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 47 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:31,992 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-03-17 11:46:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 11:46:31,993 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 11:46:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:31,993 INFO L225 Difference]: With dead ends: 53 [2025-03-17 11:46:31,993 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 11:46:31,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=2947, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 11:46:31,994 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:31,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 267 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:46:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 11:46:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2025-03-17 11:46:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-03-17 11:46:31,996 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2025-03-17 11:46:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:31,996 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-03-17 11:46:31,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-03-17 11:46:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 11:46:31,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:31,997 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:32,003 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-17 11:46:32,201 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,SelfDestructingSolverStorable17 [2025-03-17 11:46:32,201 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:32,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1817073996, now seen corresponding path program 8 times [2025-03-17 11:46:32,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:32,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624752242] [2025-03-17 11:46:32,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:32,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 11:46:32,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:46:32,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:32,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:32,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624752242] [2025-03-17 11:46:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624752242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164493985] [2025-03-17 11:46:32,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:32,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:32,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:32,399 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-17 11:46:32,400 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-17 11:46:32,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 11:46:32,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:46:32,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:32,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:32,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 11:46:32,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:32,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:32,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164493985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:32,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:32,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-17 11:46:32,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358036460] [2025-03-17 11:46:32,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:32,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 11:46:32,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:32,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 11:46:32,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:46:32,850 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:33,138 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2025-03-17 11:46:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 11:46:33,139 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 11:46:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:33,139 INFO L225 Difference]: With dead ends: 70 [2025-03-17 11:46:33,139 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 11:46:33,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 11:46:33,140 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:33,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 405 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:46:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 11:46:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-03-17 11:46:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-03-17 11:46:33,142 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 43 [2025-03-17 11:46:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:33,142 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-03-17 11:46:33,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-03-17 11:46:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 11:46:33,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:33,143 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:33,150 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-17 11:46:33,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:33,343 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:46:33,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash -365309875, now seen corresponding path program 9 times [2025-03-17 11:46:33,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:33,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405234073] [2025-03-17 11:46:33,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:46:33,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:33,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 7 equivalence classes. [2025-03-17 11:46:33,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 46 statements. [2025-03-17 11:46:33,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:46:33,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:46:33,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405234073] [2025-03-17 11:46:33,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405234073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568758433] [2025-03-17 11:46:33,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:46:33,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:33,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:33,939 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-17 11:46:33,940 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-17 11:46:33,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 7 equivalence classes. [2025-03-17 11:46:34,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 46 statements. [2025-03-17 11:46:34,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:46:34,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:34,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-17 11:46:34,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:34,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:46:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 16 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 11:46:34,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:46:35,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568758433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:35,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:35,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 22] total 62 [2025-03-17 11:46:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180020653] [2025-03-17 11:46:35,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:35,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-17 11:46:35,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:35,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-17 11:46:35,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=3601, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 11:46:35,945 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 63 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 63 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:37,329 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2025-03-17 11:46:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 11:46:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 63 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-17 11:46:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:37,330 INFO L225 Difference]: With dead ends: 50 [2025-03-17 11:46:37,330 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 11:46:37,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=708, Invalid=6774, Unknown=0, NotChecked=0, Total=7482 [2025-03-17 11:46:37,331 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:37,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:46:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 11:46:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 11:46:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 11:46:37,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2025-03-17 11:46:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:37,332 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 11:46:37,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 63 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:37,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 11:46:37,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 11:46:37,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-03-17 11:46:37,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2025-03-17 11:46:37,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2025-03-17 11:46:37,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2025-03-17 11:46:37,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2025-03-17 11:46:37,340 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-17 11:46:37,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:37,537 INFO L422 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:37,539 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:46:37,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:46:37 BoogieIcfgContainer [2025-03-17 11:46:37,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:46:37,541 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:46:37,541 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:46:37,541 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:46:37,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:46:15" (3/4) ... [2025-03-17 11:46:37,543 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:46:37,551 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 11:46:37,551 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:46:37,551 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:46:37,608 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:46:37,608 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:46:37,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:46:37,609 INFO L158 Benchmark]: Toolchain (without parser) took 22529.00ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 111.9MB in the beginning and 350.0MB in the end (delta: -238.2MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2025-03-17 11:46:37,609 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:46:37,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.71ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 94.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:46:37,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.62ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:46:37,610 INFO L158 Benchmark]: Boogie Preprocessor took 24.91ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:46:37,610 INFO L158 Benchmark]: IcfgBuilder took 222.05ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 78.5MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:46:37,610 INFO L158 Benchmark]: TraceAbstraction took 21898.67ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 78.1MB in the beginning and 357.5MB in the end (delta: -279.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:46:37,610 INFO L158 Benchmark]: Witness Printer took 66.73ms. Allocated memory is still 411.0MB. Free memory was 357.5MB in the beginning and 350.0MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:46:37,611 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.71ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 94.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.62ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.91ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 222.05ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 78.5MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21898.67ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 78.1MB in the beginning and 357.5MB in the end (delta: -279.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 66.73ms. Allocated memory is still 411.0MB. Free memory was 357.5MB in the beginning and 350.0MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 527]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 28 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 2151 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1881 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4922 IncrementalHoareTripleChecker+Invalid, 4985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 270 mSDtfsCounter, 4922 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 856 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 446 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4189 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=19, InterpolantAutomatonStates: 253, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 65 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 699 NumberOfCodeBlocks, 693 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 946 ConstructedInterpolants, 30 QuantifiedInterpolants, 11874 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1766 ConjunctsInSsa, 387 ConjunctsInUnsatCore, 42 InterpolantComputations, 10 PerfectInterpolantSequences, 297/1219 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:46:37,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE