./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrchr_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-15/cstrchr_malloc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash c0210ef89ad3c98ea9fece5cf50381a477e80228bc6d486133df1f853ef1ed9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:50:26,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:50:26,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 11:50:26,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:50:26,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:50:26,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:50:26,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:50:26,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:50:26,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:50:26,674 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:50:26,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:50:26,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:50:26,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:50:26,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:50:26,676 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:50:26,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:50:26,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:50:26,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:50:26,676 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:50:26,676 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:50:26,676 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:50:26,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:50:26,677 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:50:26,677 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:50:26,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:50:26,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:50:26,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:50:26,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:50:26,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:50:26,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:50:26,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:50:26,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:50:26,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:50:26,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:50:26,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:50:26,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:50:26,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:50:26,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:50:26,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:50:26,678 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0210ef89ad3c98ea9fece5cf50381a477e80228bc6d486133df1f853ef1ed9e [2025-03-17 11:50:26,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:50:26,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:50:26,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:50:26,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:50:26,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:50:26,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrchr_malloc.i [2025-03-17 11:50:28,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb1e7ba0/a393275183a145b68bcbe4726c813433/FLAGf2fe06926 [2025-03-17 11:50:28,322 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:50:28,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrchr_malloc.i [2025-03-17 11:50:28,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb1e7ba0/a393275183a145b68bcbe4726c813433/FLAGf2fe06926 [2025-03-17 11:50:28,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb1e7ba0/a393275183a145b68bcbe4726c813433 [2025-03-17 11:50:28,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:50:28,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:50:28,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:50:28,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:50:28,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:50:28,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c913def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28, skipping insertion in model container [2025-03-17 11:50:28,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:50:28,582 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:50:28,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:50:28,591 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:50:28,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:50:28,654 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:50:28,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28 WrapperNode [2025-03-17 11:50:28,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:50:28,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:50:28,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:50:28,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:50:28,660 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:50:28" (1/1) ... [2025-03-17 11:50:28,669 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:50:28" (1/1) ... [2025-03-17 11:50:28,684 INFO L138 Inliner]: procedures = 152, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-03-17 11:50:28,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:50:28,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:50:28,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:50:28,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:50:28,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,706 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 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:50:28,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:50:28,720 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:50:28,723 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:50:28,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:50:28,724 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (1/1) ... [2025-03-17 11:50:28,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:50:28,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:50:28,755 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:50:28,761 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:50:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:50:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:50:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:50:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:50:28,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:50:28,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:50:28,838 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:50:28,839 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:50:28,998 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: havoc cstrchr_#t~mem209#1; [2025-03-17 11:50:29,004 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-17 11:50:29,004 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:50:29,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:50:29,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:50:29,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:50:29 BoogieIcfgContainer [2025-03-17 11:50:29,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:50:29,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:50:29,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:50:29,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:50:29,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:50:28" (1/3) ... [2025-03-17 11:50:29,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:50:29, skipping insertion in model container [2025-03-17 11:50:29,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:50:28" (2/3) ... [2025-03-17 11:50:29,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:50:29, skipping insertion in model container [2025-03-17 11:50:29,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:50:29" (3/3) ... [2025-03-17 11:50:29,022 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrchr_malloc.i [2025-03-17 11:50:29,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:50:29,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrchr_malloc.i that has 1 procedures, 32 locations, 1 initial locations, 1 loop locations, and 12 error locations. [2025-03-17 11:50:29,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:50:29,065 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;@4c436df3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:50:29,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-17 11:50:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 31 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:50:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:50:29,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:29,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:50:29,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:29,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2060509, now seen corresponding path program 1 times [2025-03-17 11:50:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:29,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321624762] [2025-03-17 11:50:29,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:29,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:50:29,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:50:29,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:29,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:29,216 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:50:29,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:29,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321624762] [2025-03-17 11:50:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321624762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:50:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:50:29,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:50:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070261318] [2025-03-17 11:50:29,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:50:29,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:50:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:29,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:50:29,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:50:29,240 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 31 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:29,287 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-17 11:50:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:50:29,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 11:50:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:29,293 INFO L225 Difference]: With dead ends: 30 [2025-03-17 11:50:29,293 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 11:50:29,294 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:50:29,295 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:29,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:50:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 11:50:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 11:50:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-03-17 11:50:29,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 4 [2025-03-17 11:50:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:29,314 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-03-17 11:50:29,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-03-17 11:50:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:50:29,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:29,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:50:29,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:50:29,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:29,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2060510, now seen corresponding path program 1 times [2025-03-17 11:50:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:29,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779214396] [2025-03-17 11:50:29,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:29,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:50:29,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:50:29,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:29,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:29,489 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:50:29,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:29,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779214396] [2025-03-17 11:50:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779214396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:50:29,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:50:29,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:50:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556513232] [2025-03-17 11:50:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:50:29,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:50:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:29,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:50:29,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:50:29,490 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:29,533 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-17 11:50:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:50:29,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 11:50:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:29,535 INFO L225 Difference]: With dead ends: 30 [2025-03-17 11:50:29,535 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 11:50:29,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:50:29,536 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:29,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:50:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 11:50:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 11:50:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.6) 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:50:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-03-17 11:50:29,540 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 4 [2025-03-17 11:50:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:29,541 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-03-17 11:50:29,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-03-17 11:50:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:50:29,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:29,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:50:29,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:50:29,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:29,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:29,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2061471, now seen corresponding path program 1 times [2025-03-17 11:50:29,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:29,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149074294] [2025-03-17 11:50:29,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:29,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:50:29,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:50:29,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:29,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:29,677 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:50:29,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:29,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149074294] [2025-03-17 11:50:29,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149074294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:50:29,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:50:29,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:50:29,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257927838] [2025-03-17 11:50:29,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:50:29,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:50:29,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:29,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:50:29,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:50:29,678 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:29,694 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-03-17 11:50:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:50:29,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 11:50:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:29,695 INFO L225 Difference]: With dead ends: 29 [2025-03-17 11:50:29,696 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 11:50:29,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:50:29,697 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:29,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:50:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 11:50:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-17 11:50:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 26 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:50:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-03-17 11:50:29,702 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 4 [2025-03-17 11:50:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:29,702 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-03-17 11:50:29,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-03-17 11:50:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:50:29,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:29,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:50:29,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:50:29,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:29,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1980149145, now seen corresponding path program 1 times [2025-03-17 11:50:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:29,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73071222] [2025-03-17 11:50:29,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:29,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:50:29,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:50:29,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:29,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:29,765 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:50:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73071222] [2025-03-17 11:50:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73071222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:50:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:50:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:50:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574455343] [2025-03-17 11:50:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:50:29,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:50:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:29,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:50:29,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:50:29,768 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:50:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:29,819 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-03-17 11:50:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:50:29,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:50:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:29,819 INFO L225 Difference]: With dead ends: 24 [2025-03-17 11:50:29,819 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 11:50:29,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:50:29,820 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:29,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:50:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 11:50:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 11:50:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 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:50:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-17 11:50:29,822 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 6 [2025-03-17 11:50:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:29,822 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-17 11:50:29,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:50:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-17 11:50:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:50:29,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:29,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:50:29,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:50:29,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:29,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:29,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1980149146, now seen corresponding path program 1 times [2025-03-17 11:50:29,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:29,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012022056] [2025-03-17 11:50:29,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:29,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:50:29,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:50:29,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:29,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:29,941 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:50:29,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012022056] [2025-03-17 11:50:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012022056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:50:29,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:50:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:50:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199391489] [2025-03-17 11:50:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:50:29,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:50:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:29,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:50:29,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:50:29,942 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 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:50:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:30,002 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-17 11:50:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:50:30,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 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:50:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:30,003 INFO L225 Difference]: With dead ends: 31 [2025-03-17 11:50:30,003 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 11:50:30,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:50:30,005 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:30,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 48 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:50:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 11:50:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-17 11:50:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.36) internal successors, (34), 29 states have internal predecessors, (34), 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:50:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-17 11:50:30,010 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 6 [2025-03-17 11:50:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:30,010 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-17 11:50:30,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 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:50:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-17 11:50:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:50:30,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:30,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:50:30,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:50:30,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:30,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1856906431, now seen corresponding path program 1 times [2025-03-17 11:50:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:30,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789866417] [2025-03-17 11:50:30,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:30,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:30,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:50:30,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:50:30,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:30,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:30,047 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:50:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789866417] [2025-03-17 11:50:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789866417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:50:30,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:50:30,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:50:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942454719] [2025-03-17 11:50:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:50:30,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:50:30,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:30,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:50:30,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:50:30,052 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:30,059 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-17 11:50:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:50:30,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:50:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:30,060 INFO L225 Difference]: With dead ends: 32 [2025-03-17 11:50:30,060 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 11:50:30,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:50:30,061 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:30,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:50:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 11:50:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 11:50:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-17 11:50:30,064 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2025-03-17 11:50:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:30,064 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-17 11:50:30,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-17 11:50:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:50:30,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:30,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:50:30,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:50:30,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:30,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2076524353, now seen corresponding path program 1 times [2025-03-17 11:50:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:30,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069955635] [2025-03-17 11:50:30,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:30,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:30,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:50:30,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:50:30,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:30,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:30,211 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:50:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:30,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069955635] [2025-03-17 11:50:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069955635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:50:30,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:50:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:50:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137240947] [2025-03-17 11:50:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:50:30,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:50:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:30,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:50:30,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:50:30,213 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:50:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:30,307 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-03-17 11:50:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:50:30,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:50:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:30,308 INFO L225 Difference]: With dead ends: 43 [2025-03-17 11:50:30,308 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 11:50:30,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:50:30,309 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:30,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:50:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 11:50:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2025-03-17 11:50:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 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:50:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-17 11:50:30,314 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 12 [2025-03-17 11:50:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:30,314 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-17 11:50:30,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:50:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-17 11:50:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:50:30,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:30,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:50:30,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:50:30,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:30,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 421491584, now seen corresponding path program 1 times [2025-03-17 11:50:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:30,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249579061] [2025-03-17 11:50:30,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:30,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:50:30,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:50:30,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:30,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:30,588 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:50:30,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249579061] [2025-03-17 11:50:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249579061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:50:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540965812] [2025-03-17 11:50:30,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:30,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:50:30,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:50:30,591 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:50:30,593 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:50:30,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:50:30,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:50:30,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:30,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:30,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:50:30,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:50:30,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2025-03-17 11:50:30,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:50:30,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2025-03-17 11:50:30,916 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:50:30,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:50:31,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 11:50:31,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-17 11:50:31,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 11:50:31,145 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:50:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540965812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:50:31,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:50:31,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-17 11:50:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588211842] [2025-03-17 11:50:31,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:50:31,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:50:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:31,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:50:31,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:50:31,147 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 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:50:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:31,567 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2025-03-17 11:50:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:50:31,567 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:50:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:31,568 INFO L225 Difference]: With dead ends: 48 [2025-03-17 11:50:31,568 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 11:50:31,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:50:31,569 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 107 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:31,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 107 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:50:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 11:50:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2025-03-17 11:50:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 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:50:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-17 11:50:31,575 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 12 [2025-03-17 11:50:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:31,575 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-17 11:50:31,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 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:50:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-17 11:50:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:50:31,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:31,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:50:31,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:50:31,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:50:31,776 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:31,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1880153874, now seen corresponding path program 1 times [2025-03-17 11:50:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705803762] [2025-03-17 11:50:31,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:31,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:50:31,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:50:31,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:31,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:31,798 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:50:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705803762] [2025-03-17 11:50:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705803762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:50:31,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:50:31,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:50:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944719620] [2025-03-17 11:50:31,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:50:31,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:50:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:31,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:50:31,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:50:31,800 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 3 states, 2 states have (on average 7.0) 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:50:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:31,806 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-17 11:50:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:50:31,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) 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:50:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:31,807 INFO L225 Difference]: With dead ends: 34 [2025-03-17 11:50:31,807 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 11:50:31,807 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:50:31,807 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:31,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:50:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 11:50:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-17 11:50:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 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:50:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-17 11:50:31,810 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2025-03-17 11:50:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:31,810 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-17 11:50:31,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) 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:50:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-17 11:50:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:50:31,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:31,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:50:31,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:50:31,811 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:31,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1353357804, now seen corresponding path program 1 times [2025-03-17 11:50:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:31,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275948991] [2025-03-17 11:50:31,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:50:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:31,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:50:31,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:50:31,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:50:31,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:31,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:50:31,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275948991] [2025-03-17 11:50:31,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275948991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:50:31,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:50:31,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:50:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817606132] [2025-03-17 11:50:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:50:31,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:50:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:31,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:50:31,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:50:31,876 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:31,887 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-17 11:50:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:50:31,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 11:50:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:31,888 INFO L225 Difference]: With dead ends: 33 [2025-03-17 11:50:31,888 INFO L226 Difference]: Without dead ends: 19 [2025-03-17 11:50:31,888 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:50:31,889 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:31,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:50:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-17 11:50:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-17 11:50:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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:50:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-03-17 11:50:31,891 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2025-03-17 11:50:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:31,891 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-03-17 11:50:31,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-03-17 11:50:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:50:31,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:31,892 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 11:50:31,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:50:31,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-17 11:50:31,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash 667222565, now seen corresponding path program 2 times [2025-03-17 11:50:31,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:31,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496564038] [2025-03-17 11:50:31,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:50:31,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:31,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 11:50:31,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:50:31,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:50:31,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:50:32,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496564038] [2025-03-17 11:50:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496564038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:50:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417475484] [2025-03-17 11:50:32,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:50:32,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:50:32,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:50:32,300 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:50:32,302 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:50:32,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 11:50:32,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:50:32,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:50:32,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:32,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 11:50:32,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:50:32,360 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:50:32,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2025-03-17 11:50:33,198 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-17 11:50:33,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 29 [2025-03-17 11:50:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:50:33,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:50:33,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 11:50:33,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-03-17 11:50:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:50:33,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417475484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:50:33,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:50:33,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 30 [2025-03-17 11:50:33,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257441671] [2025-03-17 11:50:33,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:50:33,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 11:50:33,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:33,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 11:50:33,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=815, Unknown=1, NotChecked=0, Total=930 [2025-03-17 11:50:33,741 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:34,908 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2025-03-17 11:50:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:50:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 11:50:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:34,909 INFO L225 Difference]: With dead ends: 23 [2025-03-17 11:50:34,910 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 11:50:34,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=342, Invalid=1637, Unknown=1, NotChecked=0, Total=1980 [2025-03-17 11:50:34,911 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:34,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 54 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:50:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 11:50:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 11:50:34,912 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:50:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 11:50:34,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2025-03-17 11:50:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:34,912 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 11:50:34,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 11:50:34,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 11:50:34,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2025-03-17 11:50:34,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (10 of 12 remaining) [2025-03-17 11:50:34,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (9 of 12 remaining) [2025-03-17 11:50:34,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (8 of 12 remaining) [2025-03-17 11:50:34,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2025-03-17 11:50:34,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2025-03-17 11:50:34,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2025-03-17 11:50:34,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2025-03-17 11:50:34,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2025-03-17 11:50:34,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 12 remaining) [2025-03-17 11:50:34,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2025-03-17 11:50:34,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 12 remaining) [2025-03-17 11:50:34,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:50:35,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 11:50:35,120 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:50:35,121 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:50:35,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:50:35 BoogieIcfgContainer [2025-03-17 11:50:35,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:50:35,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:50:35,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:50:35,124 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:50:35,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:50:29" (3/4) ... [2025-03-17 11:50:35,126 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:50:35,131 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 11:50:35,132 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 11:50:35,132 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 11:50:35,132 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:50:35,184 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:50:35,185 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:50:35,185 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:50:35,185 INFO L158 Benchmark]: Toolchain (without parser) took 6833.08ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 122.3MB in the beginning and 289.5MB in the end (delta: -167.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2025-03-17 11:50:35,186 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:50:35,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.28ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 104.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:50:35,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.53ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 102.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:50:35,187 INFO L158 Benchmark]: Boogie Preprocessor took 33.86ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 101.6MB in the end (delta: 862.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:50:35,187 INFO L158 Benchmark]: IcfgBuilder took 292.27ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 88.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:50:35,188 INFO L158 Benchmark]: TraceAbstraction took 6108.86ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 87.2MB in the beginning and 296.8MB in the end (delta: -209.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:50:35,188 INFO L158 Benchmark]: Witness Printer took 61.11ms. Allocated memory is still 360.7MB. Free memory was 296.8MB in the beginning and 289.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:50:35,189 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.28ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 104.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.53ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 102.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.86ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 101.6MB in the end (delta: 862.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 292.27ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 88.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6108.86ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 87.2MB in the beginning and 296.8MB in the end (delta: -209.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 61.11ms. Allocated memory is still 360.7MB. Free memory was 296.8MB in the beginning and 289.5MB in the end (delta: 7.3MB). 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: 370]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 378]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 378]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 378]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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, 32 locations, 35 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 538 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 674 IncrementalHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 188 mSDtfsCounter, 674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=7, InterpolantAutomatonStates: 72, 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, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 151 ConstructedInterpolants, 11 QuantifiedInterpolants, 1625 SizeOfPredicates, 11 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 2/29 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:50:35,206 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