./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loops/string-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/loops/string-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c71ebd98a3b6e7de0397eeeb86fda8d96b2d4c8ea0b8e1766ce392ff80613de --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:13:38,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:13:38,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:13:38,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:13:38,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:13:38,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:13:38,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:13:38,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:13:38,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:13:38,785 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:13:38,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:13:38,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:13:38,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:13:38,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:13:38,787 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:13:38,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:13:38,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:13:38,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:13:38,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:13:38,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:13:38,787 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:13:38,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:13:38,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:13:38,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:13:38,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:13:38,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:13:38,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:13:38,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:13:38,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:13:38,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:13:38,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:13:38,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:13:38,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:13:38,790 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c71ebd98a3b6e7de0397eeeb86fda8d96b2d4c8ea0b8e1766ce392ff80613de [2025-03-08 23:13:39,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:13:39,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:13:39,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:13:39,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:13:39,027 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:13:39,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-1.i [2025-03-08 23:13:40,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3042c1c99/fdc0b1a41bfb41aeaeedb7ae971ea769/FLAGb940ca5c4 [2025-03-08 23:13:40,367 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:13:40,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i [2025-03-08 23:13:40,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3042c1c99/fdc0b1a41bfb41aeaeedb7ae971ea769/FLAGb940ca5c4 [2025-03-08 23:13:40,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3042c1c99/fdc0b1a41bfb41aeaeedb7ae971ea769 [2025-03-08 23:13:40,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:13:40,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:13:40,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:13:40,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:13:40,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:13:40,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b802e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40, skipping insertion in model container [2025-03-08 23:13:40,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:13:40,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:13:40,541 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:13:40,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:13:40,569 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:13:40,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40 WrapperNode [2025-03-08 23:13:40,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:13:40,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:13:40,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:13:40,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:13:40,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,597 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2025-03-08 23:13:40,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:13:40,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:13:40,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:13:40,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:13:40,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,617 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-08 23:13:40,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,624 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:13:40,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:13:40,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:13:40,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:13:40,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (1/1) ... [2025-03-08 23:13:40,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:13:40,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:40,658 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-08 23:13:40,661 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-08 23:13:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:13:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:13:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:13:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 23:13:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 23:13:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:13:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:13:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 23:13:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:13:40,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:13:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:13:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:13:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 23:13:40,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:13:40,739 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:13:40,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:13:40,897 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: call ULTIMATE.dealloc(main_~#string_A~0#1.base, main_~#string_A~0#1.offset);havoc main_~#string_A~0#1.base, main_~#string_A~0#1.offset;call ULTIMATE.dealloc(main_~#string_B~0#1.base, main_~#string_B~0#1.offset);havoc main_~#string_B~0#1.base, main_~#string_B~0#1.offset; [2025-03-08 23:13:40,907 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-08 23:13:40,907 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:13:40,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:13:40,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:13:40,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:13:40 BoogieIcfgContainer [2025-03-08 23:13:40,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:13:40,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:13:40,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:13:40,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:13:40,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:13:40" (1/3) ... [2025-03-08 23:13:40,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646b8b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:13:40, skipping insertion in model container [2025-03-08 23:13:40,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:40" (2/3) ... [2025-03-08 23:13:40,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646b8b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:13:40, skipping insertion in model container [2025-03-08 23:13:40,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:13:40" (3/3) ... [2025-03-08 23:13:40,923 INFO L128 eAbstractionObserver]: Analyzing ICFG string-1.i [2025-03-08 23:13:40,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:13:40,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG string-1.i that has 1 procedures, 49 locations, 1 initial locations, 5 loop locations, and 18 error locations. [2025-03-08 23:13:40,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:13:40,973 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;@7125557a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:13:40,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-08 23:13:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 2.033333333333333) internal successors, (61), 48 states have internal predecessors, (61), 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-08 23:13:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 23:13:40,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:40,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 23:13:40,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:40,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:40,987 INFO L85 PathProgramCache]: Analyzing trace with hash 3231262, now seen corresponding path program 1 times [2025-03-08 23:13:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:40,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708187463] [2025-03-08 23:13:40,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:41,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 23:13:41,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 23:13:41,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:41,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:41,184 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-08 23:13:41,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:41,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708187463] [2025-03-08 23:13:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708187463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:41,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:13:41,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:13:41,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216698454] [2025-03-08 23:13:41,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:41,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:13:41,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:41,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:13:41,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:13:41,209 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 2.033333333333333) internal successors, (61), 48 states have internal predecessors, (61), 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-08 23:13:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:41,271 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-08 23:13:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:13:41,273 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-08 23:13:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:41,277 INFO L225 Difference]: With dead ends: 44 [2025-03-08 23:13:41,279 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 23:13:41,280 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-08 23:13:41,283 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:41,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 23:13:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 23:13:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 41 states have internal predecessors, (50), 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-08 23:13:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-08 23:13:41,307 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 4 [2025-03-08 23:13:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:41,308 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-08 23:13:41,308 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-08 23:13:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-03-08 23:13:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 23:13:41,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:41,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 23:13:41,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:13:41,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:41,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash 3231263, now seen corresponding path program 1 times [2025-03-08 23:13:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:41,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563055944] [2025-03-08 23:13:41,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:41,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:41,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 23:13:41,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 23:13:41,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:41,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:41,453 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-08 23:13:41,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:41,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563055944] [2025-03-08 23:13:41,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563055944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:41,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:13:41,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:13:41,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95709262] [2025-03-08 23:13:41,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:41,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:13:41,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:41,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:13:41,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:13:41,456 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. 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-08 23:13:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:41,514 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-03-08 23:13:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:13:41,515 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-08 23:13:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:41,515 INFO L225 Difference]: With dead ends: 45 [2025-03-08 23:13:41,515 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 23:13:41,515 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-08 23:13:41,516 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:41,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 23:13:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-08 23:13:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 43 states have internal predecessors, (52), 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-08 23:13:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-08 23:13:41,521 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 4 [2025-03-08 23:13:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:41,522 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-08 23:13:41,522 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-08 23:13:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-08 23:13:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 23:13:41,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:41,522 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-08 23:13:41,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:13:41,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:41,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1773283590, now seen corresponding path program 1 times [2025-03-08 23:13:41,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:41,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138599629] [2025-03-08 23:13:41,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:41,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:13:41,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:13:41,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:41,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:13:41,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138599629] [2025-03-08 23:13:41,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138599629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325007511] [2025-03-08 23:13:41,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:41,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:41,652 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-08 23:13:41,653 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-08 23:13:41,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:13:41,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:13:41,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:41,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:41,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 23:13:41,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:41,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 23:13:41,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:13:41,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:13:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:13:41,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:13:41,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325007511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:41,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:41,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-08 23:13:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469256036] [2025-03-08 23:13:41,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:41,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:13:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:41,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:13:41,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:13:41,924 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-08 23:13:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:42,036 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-08 23:13:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:13:42,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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) Word has length 7 [2025-03-08 23:13:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:42,037 INFO L225 Difference]: With dead ends: 53 [2025-03-08 23:13:42,037 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 23:13:42,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:13:42,038 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:42,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 91 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 23:13:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 23:13:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 52 states have internal predecessors, (63), 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-08 23:13:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-08 23:13:42,041 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 7 [2025-03-08 23:13:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:42,041 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-08 23:13:42,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-08 23:13:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-08 23:13:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:13:42,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:42,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-08 23:13:42,048 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-08 23:13:42,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:42,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:42,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash -206303014, now seen corresponding path program 1 times [2025-03-08 23:13:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:42,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260297865] [2025-03-08 23:13:42,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:42,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:13:42,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:13:42,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:42,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:13:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260297865] [2025-03-08 23:13:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260297865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390053925] [2025-03-08 23:13:42,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:42,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:42,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:42,288 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-08 23:13:42,288 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-08 23:13:42,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:13:42,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:13:42,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:42,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:42,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 23:13:42,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:13:42,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:13:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390053925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:42,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 23:13:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680083764] [2025-03-08 23:13:42,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:13:42,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:42,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:13:42,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:13:42,374 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-08 23:13:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:42,459 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2025-03-08 23:13:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:13:42,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-08 23:13:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:42,460 INFO L225 Difference]: With dead ends: 102 [2025-03-08 23:13:42,461 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 23:13:42,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:13:42,462 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 106 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:42,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 82 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 23:13:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2025-03-08 23:13:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 67 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2025-03-08 23:13:42,466 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 10 [2025-03-08 23:13:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:42,466 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2025-03-08 23:13:42,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-08 23:13:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2025-03-08 23:13:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:13:42,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:42,466 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-03-08 23:13:42,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:42,671 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,SelfDestructingSolverStorable3 [2025-03-08 23:13:42,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:42,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1182948191, now seen corresponding path program 2 times [2025-03-08 23:13:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509217598] [2025-03-08 23:13:42,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:42,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 23:13:42,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:13:42,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:42,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:13:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509217598] [2025-03-08 23:13:42,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509217598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750402312] [2025-03-08 23:13:42,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:42,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:42,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:42,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:42,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 23:13:42,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 23:13:42,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:13:42,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:42,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:42,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 23:13:42,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:42,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 23:13:42,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:13:42,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:13:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:13:43,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:13:43,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750402312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:43,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:13:43,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2025-03-08 23:13:43,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512806807] [2025-03-08 23:13:43,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:43,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:13:43,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:43,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:13:43,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:13:43,102 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-08 23:13:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:43,185 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2025-03-08 23:13:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:13:43,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-08 23:13:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:43,186 INFO L225 Difference]: With dead ends: 67 [2025-03-08 23:13:43,186 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 23:13:43,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:13:43,186 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:43,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 23:13:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 23:13:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.537037037037037) internal successors, (83), 66 states have internal predecessors, (83), 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-08 23:13:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2025-03-08 23:13:43,194 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 16 [2025-03-08 23:13:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:43,194 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2025-03-08 23:13:43,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-08 23:13:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2025-03-08 23:13:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:13:43,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:43,195 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1] [2025-03-08 23:13:43,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 23:13:43,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:43,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:43,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1002902497, now seen corresponding path program 2 times [2025-03-08 23:13:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:43,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101932353] [2025-03-08 23:13:43,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:43,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 23:13:43,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 19 statements. [2025-03-08 23:13:43,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 23:13:43,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:43,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101932353] [2025-03-08 23:13:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101932353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:43,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:13:43,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:13:43,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70516341] [2025-03-08 23:13:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:13:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:43,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:13:43,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:13:43,433 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-08 23:13:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:43,455 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2025-03-08 23:13:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:13:43,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 19 [2025-03-08 23:13:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:43,456 INFO L225 Difference]: With dead ends: 66 [2025-03-08 23:13:43,456 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 23:13:43,457 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-08 23:13:43,457 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 31 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-08 23:13:43,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 31 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 23:13:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 23:13:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 65 states have internal predecessors, (82), 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-08 23:13:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-03-08 23:13:43,460 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 19 [2025-03-08 23:13:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:43,460 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-08 23:13:43,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-08 23:13:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2025-03-08 23:13:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:13:43,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:43,461 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:43,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:13:43,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:43,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1716625314, now seen corresponding path program 1 times [2025-03-08 23:13:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524537911] [2025-03-08 23:13:43,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:43,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:13:43,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:13:43,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524537911] [2025-03-08 23:13:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524537911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:43,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:13:43,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:13:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188771204] [2025-03-08 23:13:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:43,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:13:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:43,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:13:43,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:13:43,584 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:43,619 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2025-03-08 23:13:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:13:43,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 23:13:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:43,620 INFO L225 Difference]: With dead ends: 65 [2025-03-08 23:13:43,620 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 23:13:43,621 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-08 23:13:43,621 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:43,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 48 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 23:13:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-08 23:13:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 62 states have internal predecessors, (76), 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-08 23:13:43,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2025-03-08 23:13:43,624 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 21 [2025-03-08 23:13:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:43,624 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2025-03-08 23:13:43,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2025-03-08 23:13:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:13:43,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:43,624 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:43,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:13:43,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:43,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1675780927, now seen corresponding path program 1 times [2025-03-08 23:13:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140260663] [2025-03-08 23:13:43,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:43,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:13:43,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:13:43,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:43,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140260663] [2025-03-08 23:13:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140260663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:13:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:13:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850061015] [2025-03-08 23:13:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:43,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:13:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:43,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:13:43,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:13:43,674 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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-08 23:13:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:43,691 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2025-03-08 23:13:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:13:43,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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 22 [2025-03-08 23:13:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:43,692 INFO L225 Difference]: With dead ends: 59 [2025-03-08 23:13:43,692 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 23:13:43,692 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-08 23:13:43,692 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:43,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 26 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 23:13:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 23:13:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 58 states have internal predecessors, (68), 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-08 23:13:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-03-08 23:13:43,698 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 22 [2025-03-08 23:13:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:43,699 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-03-08 23:13:43,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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-08 23:13:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-03-08 23:13:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:13:43,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:43,700 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:43,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:13:43,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:43,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1675780928, now seen corresponding path program 1 times [2025-03-08 23:13:43,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:43,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048771502] [2025-03-08 23:13:43,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:43,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:43,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:13:43,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:13:43,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:43,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:43,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:43,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048771502] [2025-03-08 23:13:43,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048771502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:43,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:13:43,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:13:43,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451482766] [2025-03-08 23:13:43,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:43,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:13:43,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:43,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:13:43,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:13:43,780 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-08 23:13:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:43,826 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-03-08 23:13:43,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:13:43,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 22 [2025-03-08 23:13:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:43,827 INFO L225 Difference]: With dead ends: 62 [2025-03-08 23:13:43,827 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 23:13:43,827 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-08 23:13:43,828 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:43,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 26 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 23:13:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-03-08 23:13:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 57 states have internal predecessors, (66), 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-08 23:13:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-03-08 23:13:43,831 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 22 [2025-03-08 23:13:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:43,831 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-08 23:13:43,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-08 23:13:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2025-03-08 23:13:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:13:43,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:43,832 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:43,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 23:13:43,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:43,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1510228489, now seen corresponding path program 1 times [2025-03-08 23:13:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:43,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741510664] [2025-03-08 23:13:43,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:43,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:13:43,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:13:43,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:43,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741510664] [2025-03-08 23:13:43,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741510664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904023559] [2025-03-08 23:13:43,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:43,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:43,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 23:13:43,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:13:43,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:13:43,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:43,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:43,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 23:13:43,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:43,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 23:13:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:44,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904023559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:44,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:44,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-08 23:13:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222019172] [2025-03-08 23:13:44,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:44,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:13:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:44,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:13:44,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:13:44,182 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 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-08 23:13:44,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:44,296 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2025-03-08 23:13:44,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:13:44,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 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 25 [2025-03-08 23:13:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:44,297 INFO L225 Difference]: With dead ends: 74 [2025-03-08 23:13:44,297 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 23:13:44,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:13:44,298 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 130 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:44,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 36 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 23:13:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2025-03-08 23:13:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 57 states have internal predecessors, (63), 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-08 23:13:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-03-08 23:13:44,300 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 25 [2025-03-08 23:13:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:44,301 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-03-08 23:13:44,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 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-08 23:13:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-03-08 23:13:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 23:13:44,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:44,301 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:44,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 23:13:44,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:44,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:44,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1938640000, now seen corresponding path program 2 times [2025-03-08 23:13:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:44,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913320213] [2025-03-08 23:13:44,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:44,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 23:13:44,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 23:13:44,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:44,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:44,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:44,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913320213] [2025-03-08 23:13:44,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913320213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:44,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055061800] [2025-03-08 23:13:44,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:44,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:44,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:44,694 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:44,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 23:13:44,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 23:13:44,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 23:13:44,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:44,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:44,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 23:13:44,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:44,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 23:13:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:44,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:13:44,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055061800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:44,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:13:44,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-08 23:13:44,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634103492] [2025-03-08 23:13:44,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:44,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:13:44,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:44,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:13:44,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-08 23:13:44,956 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-08 23:13:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:45,071 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2025-03-08 23:13:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:13:45,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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 34 [2025-03-08 23:13:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:45,072 INFO L225 Difference]: With dead ends: 77 [2025-03-08 23:13:45,073 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 23:13:45,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-08 23:13:45,073 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:45,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 24 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 23:13:45,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2025-03-08 23:13:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 56 states have internal predecessors, (62), 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-08 23:13:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-03-08 23:13:45,080 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 34 [2025-03-08 23:13:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:45,080 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-03-08 23:13:45,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-08 23:13:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-03-08 23:13:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 23:13:45,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:45,080 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:45,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:45,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 23:13:45,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:45,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1190747914, now seen corresponding path program 1 times [2025-03-08 23:13:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:45,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989620746] [2025-03-08 23:13:45,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:45,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:45,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:13:45,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:13:45,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:45,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 23:13:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989620746] [2025-03-08 23:13:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989620746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914723172] [2025-03-08 23:13:45,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:45,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:45,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:45,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:45,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 23:13:45,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:13:45,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:13:45,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:45,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:45,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 23:13:45,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:45,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:45,681 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 20 treesize of output 16 [2025-03-08 23:13:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:45,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914723172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:45,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:45,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 18 [2025-03-08 23:13:45,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89903282] [2025-03-08 23:13:45,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:45,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 23:13:45,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:45,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 23:13:45,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-08 23:13:45,782 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 19 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 19 states have internal predecessors, (69), 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-08 23:13:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:46,166 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2025-03-08 23:13:46,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 23:13:46,166 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 19 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-08 23:13:46,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:46,167 INFO L225 Difference]: With dead ends: 91 [2025-03-08 23:13:46,167 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 23:13:46,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 23:13:46,168 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 183 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:46,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 60 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:13:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 23:13:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2025-03-08 23:13:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 66 states have internal predecessors, (76), 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-08 23:13:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-03-08 23:13:46,170 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 39 [2025-03-08 23:13:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:46,170 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-03-08 23:13:46,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 19 states have internal predecessors, (69), 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-08 23:13:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-03-08 23:13:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 23:13:46,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:46,170 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:46,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:46,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:46,371 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:46,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1436188350, now seen corresponding path program 1 times [2025-03-08 23:13:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18591850] [2025-03-08 23:13:46,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:46,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 23:13:46,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 23:13:46,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:46,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:46,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:46,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18591850] [2025-03-08 23:13:46,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18591850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:46,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:13:46,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:13:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592031195] [2025-03-08 23:13:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:46,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:13:46,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:46,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:13:46,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:13:46,466 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:46,492 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2025-03-08 23:13:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:13:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-08 23:13:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:46,493 INFO L225 Difference]: With dead ends: 81 [2025-03-08 23:13:46,493 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 23:13:46,493 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-08 23:13:46,494 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:46,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 23:13:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2025-03-08 23:13:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.21875) internal successors, (78), 68 states have internal predecessors, (78), 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-08 23:13:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-03-08 23:13:46,496 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 42 [2025-03-08 23:13:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:46,496 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-03-08 23:13:46,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-03-08 23:13:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 23:13:46,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:46,497 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:46,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:13:46,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:46,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1572200716, now seen corresponding path program 1 times [2025-03-08 23:13:46,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:46,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274699981] [2025-03-08 23:13:46,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:46,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:46,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:13:46,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:13:46,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:46,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274699981] [2025-03-08 23:13:46,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274699981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154943424] [2025-03-08 23:13:46,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:46,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:46,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:46,607 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:46,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 23:13:46,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:13:46,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:13:46,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:46,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:46,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 23:13:46,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:46,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:46,987 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 22 treesize of output 18 [2025-03-08 23:13:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:47,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154943424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:47,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 24 [2025-03-08 23:13:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187116659] [2025-03-08 23:13:47,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:47,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 23:13:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:47,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 23:13:47,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2025-03-08 23:13:47,087 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 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-08 23:13:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:47,822 INFO L93 Difference]: Finished difference Result 162 states and 215 transitions. [2025-03-08 23:13:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 23:13:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-08 23:13:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:47,823 INFO L225 Difference]: With dead ends: 162 [2025-03-08 23:13:47,823 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 23:13:47,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=633, Invalid=1817, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 23:13:47,825 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 323 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:47,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 130 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:13:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 23:13:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 101. [2025-03-08 23:13:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 100 states have internal predecessors, (131), 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-08 23:13:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2025-03-08 23:13:47,829 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 43 [2025-03-08 23:13:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:47,829 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2025-03-08 23:13:47,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 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-08 23:13:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2025-03-08 23:13:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 23:13:47,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:47,830 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:47,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:48,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:48,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:48,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1492501439, now seen corresponding path program 1 times [2025-03-08 23:13:48,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:48,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463537932] [2025-03-08 23:13:48,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:48,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 23:13:48,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 23:13:48,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:48,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:48,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:48,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463537932] [2025-03-08 23:13:48,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463537932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:48,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806799875] [2025-03-08 23:13:48,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:48,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:48,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:48,150 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:48,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 23:13:48,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 23:13:48,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 23:13:48,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:48,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:48,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 23:13:48,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:48,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:48,411 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 22 treesize of output 18 [2025-03-08 23:13:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:48,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806799875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:48,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:48,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 22 [2025-03-08 23:13:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967735389] [2025-03-08 23:13:48,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:48,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 23:13:48,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:48,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 23:13:48,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-03-08 23:13:48,536 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 23 states, 22 states have (on average 3.727272727272727) internal successors, (82), 23 states have internal predecessors, (82), 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-08 23:13:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:49,175 INFO L93 Difference]: Finished difference Result 325 states and 525 transitions. [2025-03-08 23:13:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 23:13:49,175 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.727272727272727) internal successors, (82), 23 states have internal predecessors, (82), 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 44 [2025-03-08 23:13:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:49,176 INFO L225 Difference]: With dead ends: 325 [2025-03-08 23:13:49,177 INFO L226 Difference]: Without dead ends: 325 [2025-03-08 23:13:49,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=806, Invalid=1644, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 23:13:49,178 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 303 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:49,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 95 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:13:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-08 23:13:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 125. [2025-03-08 23:13:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 124 states have internal predecessors, (167), 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-08 23:13:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2025-03-08 23:13:49,182 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 44 [2025-03-08 23:13:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:49,182 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2025-03-08 23:13:49,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.727272727272727) internal successors, (82), 23 states have internal predecessors, (82), 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-08 23:13:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2025-03-08 23:13:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 23:13:49,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:49,183 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:49,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 23:13:49,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 23:13:49,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:49,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:49,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1089700846, now seen corresponding path program 1 times [2025-03-08 23:13:49,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:49,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382025579] [2025-03-08 23:13:49,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:49,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:49,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 23:13:49,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:13:49,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:49,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:49,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:49,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382025579] [2025-03-08 23:13:49,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382025579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:49,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:13:49,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:13:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759483091] [2025-03-08 23:13:49,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:49,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:13:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:49,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:13:49,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:13:49,496 INFO L87 Difference]: Start difference. First operand 125 states and 167 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:49,520 INFO L93 Difference]: Finished difference Result 129 states and 171 transitions. [2025-03-08 23:13:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:13:49,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 23:13:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:49,521 INFO L225 Difference]: With dead ends: 129 [2025-03-08 23:13:49,521 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 23:13:49,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:13:49,521 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:49,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 23:13:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-08 23:13:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 117 states have internal predecessors, (145), 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-08 23:13:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2025-03-08 23:13:49,525 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 49 [2025-03-08 23:13:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:49,525 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2025-03-08 23:13:49,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2025-03-08 23:13:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 23:13:49,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:49,525 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:49,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 23:13:49,525 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:49,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:49,526 INFO L85 PathProgramCache]: Analyzing trace with hash 895566895, now seen corresponding path program 2 times [2025-03-08 23:13:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:49,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300161542] [2025-03-08 23:13:49,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:49,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:49,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 23:13:49,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:13:49,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:49,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:49,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:49,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300161542] [2025-03-08 23:13:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300161542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:49,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150603187] [2025-03-08 23:13:49,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:49,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:49,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:49,706 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:49,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 23:13:49,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 23:13:49,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:13:49,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:49,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:49,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 23:13:49,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:49,864 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 15 treesize of output 1 [2025-03-08 23:13:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 23:13:50,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:50,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150603187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:50,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:50,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 10] total 30 [2025-03-08 23:13:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112334133] [2025-03-08 23:13:50,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:50,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 23:13:50,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:50,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 23:13:50,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2025-03-08 23:13:50,196 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 30 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 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-08 23:13:50,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:50,850 INFO L93 Difference]: Finished difference Result 188 states and 226 transitions. [2025-03-08 23:13:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 23:13:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 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 49 [2025-03-08 23:13:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:50,851 INFO L225 Difference]: With dead ends: 188 [2025-03-08 23:13:50,851 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 23:13:50,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=294, Invalid=1962, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 23:13:50,852 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 333 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:50,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 744 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:13:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 23:13:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 143. [2025-03-08 23:13:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.3071428571428572) internal successors, (183), 142 states have internal predecessors, (183), 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-08 23:13:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2025-03-08 23:13:50,855 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 49 [2025-03-08 23:13:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:50,855 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2025-03-08 23:13:50,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 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-08 23:13:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2025-03-08 23:13:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 23:13:50,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:50,856 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:50,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 23:13:51,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 23:13:51,056 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:51,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1295226558, now seen corresponding path program 2 times [2025-03-08 23:13:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:51,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240264934] [2025-03-08 23:13:51,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:51,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 23:13:51,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 23:13:51,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:51,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:51,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:51,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240264934] [2025-03-08 23:13:51,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240264934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:51,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244314664] [2025-03-08 23:13:51,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:51,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:51,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:51,211 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:51,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 23:13:51,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 23:13:51,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 23:13:51,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:51,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 23:13:51,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:51,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:51,508 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 7 treesize of output 5 [2025-03-08 23:13:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:51,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244314664] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:51,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:51,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-08 23:13:51,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811528410] [2025-03-08 23:13:51,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:51,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 23:13:51,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:51,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 23:13:51,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2025-03-08 23:13:51,553 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 22 states have internal predecessors, (76), 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-08 23:13:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:51,694 INFO L93 Difference]: Finished difference Result 330 states and 454 transitions. [2025-03-08 23:13:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:13:51,694 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 22 states have internal predecessors, (76), 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 50 [2025-03-08 23:13:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:51,695 INFO L225 Difference]: With dead ends: 330 [2025-03-08 23:13:51,696 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 23:13:51,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 23:13:51,696 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 152 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:51,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 175 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 23:13:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 153. [2025-03-08 23:13:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 152 states have internal predecessors, (197), 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-08 23:13:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2025-03-08 23:13:51,704 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 50 [2025-03-08 23:13:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:51,704 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2025-03-08 23:13:51,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 22 states have internal predecessors, (76), 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-08 23:13:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2025-03-08 23:13:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 23:13:51,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:51,705 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:51,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:51,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 23:13:51,909 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:51,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash 707896349, now seen corresponding path program 1 times [2025-03-08 23:13:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660317008] [2025-03-08 23:13:51,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:51,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 23:13:51,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:13:51,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:51,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-08 23:13:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:51,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660317008] [2025-03-08 23:13:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660317008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:13:51,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:13:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:13:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622715392] [2025-03-08 23:13:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:13:51,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:13:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:51,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:13:51,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:13:51,991 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:52,016 INFO L93 Difference]: Finished difference Result 160 states and 203 transitions. [2025-03-08 23:13:52,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:13:52,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-08 23:13:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:52,017 INFO L225 Difference]: With dead ends: 160 [2025-03-08 23:13:52,017 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 23:13:52,018 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-08 23:13:52,018 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:52,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 23:13:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2025-03-08 23:13:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 156 states have internal predecessors, (199), 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-08 23:13:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 199 transitions. [2025-03-08 23:13:52,021 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 199 transitions. Word has length 51 [2025-03-08 23:13:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:52,021 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 199 transitions. [2025-03-08 23:13:52,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:13:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2025-03-08 23:13:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 23:13:52,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:52,023 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:52,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 23:13:52,023 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:52,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash 827792707, now seen corresponding path program 3 times [2025-03-08 23:13:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902333809] [2025-03-08 23:13:52,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:13:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:52,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-08 23:13:52,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 52 statements. [2025-03-08 23:13:52,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 23:13:52,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-08 23:13:52,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902333809] [2025-03-08 23:13:52,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902333809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371126631] [2025-03-08 23:13:52,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:13:52,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:52,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:52,256 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:52,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 23:13:52,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-08 23:13:52,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 52 statements. [2025-03-08 23:13:52,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 23:13:52,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 23:13:52,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:52,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:13:52,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:13:52,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2025-03-08 23:13:52,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:13:52,507 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 15 treesize of output 15 [2025-03-08 23:13:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-08 23:13:52,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:52,641 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-08 23:13:52,641 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 22 treesize of output 15 [2025-03-08 23:13:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-08 23:13:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371126631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:52,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-03-08 23:13:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795514788] [2025-03-08 23:13:52,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 23:13:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:52,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 23:13:52,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-03-08 23:13:52,789 INFO L87 Difference]: Start difference. First operand 157 states and 199 transitions. Second operand has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 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-08 23:13:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:52,996 INFO L93 Difference]: Finished difference Result 169 states and 214 transitions. [2025-03-08 23:13:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 23:13:52,997 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 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 52 [2025-03-08 23:13:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:52,997 INFO L225 Difference]: With dead ends: 169 [2025-03-08 23:13:52,998 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 23:13:52,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 23:13:52,998 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 94 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:52,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 33 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 23:13:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2025-03-08 23:13:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.236842105263158) internal successors, (141), 115 states have internal predecessors, (141), 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-08 23:13:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2025-03-08 23:13:53,004 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 52 [2025-03-08 23:13:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:53,005 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2025-03-08 23:13:53,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 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-08 23:13:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2025-03-08 23:13:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 23:13:53,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:53,005 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:53,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 23:13:53,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:53,210 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:53,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:53,210 INFO L85 PathProgramCache]: Analyzing trace with hash 650666228, now seen corresponding path program 1 times [2025-03-08 23:13:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922390180] [2025-03-08 23:13:53,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:53,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 23:13:53,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 23:13:53,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:53,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 23:13:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922390180] [2025-03-08 23:13:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922390180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179495312] [2025-03-08 23:13:53,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:53,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:53,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:53,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:53,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 23:13:53,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 23:13:53,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 23:13:53,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:53,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:53,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 23:13:53,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 23:13:53,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 23:13:53,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179495312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:53,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:53,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 23:13:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790322885] [2025-03-08 23:13:53,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:53,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:13:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:53,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:13:53,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:13:53,436 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-08 23:13:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:53,489 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2025-03-08 23:13:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:13:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 54 [2025-03-08 23:13:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:53,490 INFO L225 Difference]: With dead ends: 115 [2025-03-08 23:13:53,490 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 23:13:53,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:13:53,491 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:53,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 23:13:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 23:13:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 103 states have internal predecessors, (126), 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-08 23:13:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2025-03-08 23:13:53,493 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 54 [2025-03-08 23:13:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:53,493 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2025-03-08 23:13:53,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-08 23:13:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2025-03-08 23:13:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 23:13:53,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:53,494 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:53,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:53,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 23:13:53,694 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:53,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash -809551949, now seen corresponding path program 2 times [2025-03-08 23:13:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:53,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118097820] [2025-03-08 23:13:53,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:53,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:53,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 23:13:53,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 23:13:53,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:53,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 23:13:53,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:53,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118097820] [2025-03-08 23:13:53,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118097820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:53,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129411975] [2025-03-08 23:13:53,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:53,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:53,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:53,798 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:53,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 23:13:53,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 23:13:53,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 23:13:53,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:53,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:53,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 23:13:53,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 23:13:53,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 23:13:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129411975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:53,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 23:13:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753429160] [2025-03-08 23:13:53,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:13:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:53,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:13:53,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:13:53,941 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-08 23:13:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:53,970 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2025-03-08 23:13:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:13:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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 56 [2025-03-08 23:13:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:53,972 INFO L225 Difference]: With dead ends: 113 [2025-03-08 23:13:53,972 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 23:13:53,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:13:53,973 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:53,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:13:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 23:13:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 23:13:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 109 states have internal predecessors, (132), 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-08 23:13:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2025-03-08 23:13:53,975 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 56 [2025-03-08 23:13:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:53,975 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2025-03-08 23:13:53,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-08 23:13:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2025-03-08 23:13:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 23:13:53,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:53,979 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:53,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:54,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 23:13:54,180 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:54,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1491232780, now seen corresponding path program 3 times [2025-03-08 23:13:54,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:54,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974323849] [2025-03-08 23:13:54,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:13:54,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:54,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 6 equivalence classes. [2025-03-08 23:13:54,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 58 statements. [2025-03-08 23:13:54,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 23:13:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 23:13:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974323849] [2025-03-08 23:13:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974323849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190804818] [2025-03-08 23:13:54,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:13:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:54,262 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:54,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 23:13:54,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 6 equivalence classes. [2025-03-08 23:13:54,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 58 statements. [2025-03-08 23:13:54,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 23:13:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:54,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 23:13:54,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 23:13:54,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:54,575 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 7 treesize of output 5 [2025-03-08 23:13:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 23:13:54,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190804818] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:54,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:54,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-03-08 23:13:54,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224605195] [2025-03-08 23:13:54,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:54,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 23:13:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:54,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 23:13:54,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:13:54,597 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand has 15 states, 14 states have (on average 5.928571428571429) internal successors, (83), 15 states have internal predecessors, (83), 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-08 23:13:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:54,829 INFO L93 Difference]: Finished difference Result 146 states and 173 transitions. [2025-03-08 23:13:54,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 23:13:54,829 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.928571428571429) internal successors, (83), 15 states have internal predecessors, (83), 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 58 [2025-03-08 23:13:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:54,830 INFO L225 Difference]: With dead ends: 146 [2025-03-08 23:13:54,830 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 23:13:54,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2025-03-08 23:13:54,830 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 80 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:54,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 39 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 23:13:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 135. [2025-03-08 23:13:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 133 states have (on average 1.1879699248120301) internal successors, (158), 134 states have internal predecessors, (158), 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-08 23:13:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2025-03-08 23:13:54,837 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 58 [2025-03-08 23:13:54,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:54,837 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2025-03-08 23:13:54,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.928571428571429) internal successors, (83), 15 states have internal predecessors, (83), 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-08 23:13:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2025-03-08 23:13:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 23:13:54,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:54,837 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:54,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 23:13:55,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:55,038 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:55,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1016394242, now seen corresponding path program 1 times [2025-03-08 23:13:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:55,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186853323] [2025-03-08 23:13:55,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:55,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 23:13:55,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 23:13:55,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:55,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 23:13:55,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186853323] [2025-03-08 23:13:55,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186853323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385800637] [2025-03-08 23:13:55,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:55,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:55,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:55,124 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:55,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 23:13:55,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 23:13:55,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 23:13:55,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:55,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:55,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 23:13:55,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 23:13:55,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:55,453 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 22 treesize of output 18 [2025-03-08 23:13:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 23:13:55,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385800637] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:55,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 22 [2025-03-08 23:13:55,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577310030] [2025-03-08 23:13:55,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:55,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 23:13:55,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:55,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 23:13:55,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-03-08 23:13:55,563 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 23 states, 22 states have (on average 4.954545454545454) internal successors, (109), 23 states have internal predecessors, (109), 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-08 23:13:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:55,898 INFO L93 Difference]: Finished difference Result 238 states and 284 transitions. [2025-03-08 23:13:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 23:13:55,901 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.954545454545454) internal successors, (109), 23 states have internal predecessors, (109), 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 59 [2025-03-08 23:13:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:55,901 INFO L225 Difference]: With dead ends: 238 [2025-03-08 23:13:55,901 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 23:13:55,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=575, Invalid=1147, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 23:13:55,902 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 119 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:55,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 58 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:13:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 23:13:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 156. [2025-03-08 23:13:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 154 states have (on average 1.1623376623376624) internal successors, (179), 155 states have internal predecessors, (179), 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-08 23:13:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2025-03-08 23:13:55,907 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 59 [2025-03-08 23:13:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:55,907 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2025-03-08 23:13:55,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.954545454545454) internal successors, (109), 23 states have internal predecessors, (109), 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-08 23:13:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2025-03-08 23:13:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 23:13:55,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:55,907 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:55,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 23:13:56,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:56,108 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:56,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash 486570604, now seen corresponding path program 4 times [2025-03-08 23:13:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:56,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846469452] [2025-03-08 23:13:56,108 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 23:13:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:56,116 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-03-08 23:13:56,120 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 66 statements. [2025-03-08 23:13:56,120 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 23:13:56,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 23:13:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846469452] [2025-03-08 23:13:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846469452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774996943] [2025-03-08 23:13:56,220 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 23:13:56,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:56,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:56,222 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:56,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 23:13:56,278 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-03-08 23:13:56,296 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 66 statements. [2025-03-08 23:13:56,296 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 23:13:56,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:56,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 23:13:56,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 23:13:56,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 23:13:56,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774996943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:56,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:56,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-03-08 23:13:56,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047679177] [2025-03-08 23:13:56,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:56,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 23:13:56,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:56,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 23:13:56,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-08 23:13:56,405 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 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-08 23:13:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:56,489 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2025-03-08 23:13:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:13:56,490 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 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 66 [2025-03-08 23:13:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:56,490 INFO L225 Difference]: With dead ends: 144 [2025-03-08 23:13:56,490 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 23:13:56,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-08 23:13:56,491 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:56,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 23:13:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-08 23:13:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 121 states have internal predecessors, (139), 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-08 23:13:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2025-03-08 23:13:56,493 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 66 [2025-03-08 23:13:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:56,493 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2025-03-08 23:13:56,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 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-08 23:13:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2025-03-08 23:13:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 23:13:56,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:56,493 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:56,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:56,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 23:13:56,698 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:56,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:56,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2144851285, now seen corresponding path program 5 times [2025-03-08 23:13:56,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:56,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452664996] [2025-03-08 23:13:56,698 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 23:13:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:56,705 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 6 equivalence classes. [2025-03-08 23:13:56,737 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 23:13:56,737 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 23:13:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 23:13:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452664996] [2025-03-08 23:13:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452664996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330301099] [2025-03-08 23:13:56,857 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 23:13:56,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:56,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:56,859 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:56,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 23:13:56,920 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 6 equivalence classes. [2025-03-08 23:13:57,004 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 23:13:57,004 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 23:13:57,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:57,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 23:13:57,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 23:13:57,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 23:13:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330301099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:57,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:57,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2025-03-08 23:13:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122682781] [2025-03-08 23:13:57,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:57,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 23:13:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:57,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 23:13:57,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-03-08 23:13:57,306 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 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-08 23:13:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:57,929 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2025-03-08 23:13:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 23:13:57,930 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 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 68 [2025-03-08 23:13:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:57,931 INFO L225 Difference]: With dead ends: 226 [2025-03-08 23:13:57,931 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 23:13:57,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=793, Invalid=3497, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 23:13:57,932 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 121 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:57,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 173 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:13:57,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 23:13:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2025-03-08 23:13:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.1419354838709677) internal successors, (177), 156 states have internal predecessors, (177), 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-08 23:13:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2025-03-08 23:13:57,937 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 68 [2025-03-08 23:13:57,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:57,937 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2025-03-08 23:13:57,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 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-08 23:13:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2025-03-08 23:13:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 23:13:57,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:57,937 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:57,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:58,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 23:13:58,138 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:58,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash -885239125, now seen corresponding path program 6 times [2025-03-08 23:13:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616823008] [2025-03-08 23:13:58,139 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 23:13:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:58,147 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 72 statements into 6 equivalence classes. [2025-03-08 23:13:58,165 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 58 of 72 statements. [2025-03-08 23:13:58,166 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 23:13:58,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 23:13:58,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616823008] [2025-03-08 23:13:58,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616823008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930662561] [2025-03-08 23:13:58,226 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 23:13:58,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:58,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:58,228 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:58,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 23:13:58,295 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 72 statements into 6 equivalence classes. [2025-03-08 23:13:58,325 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 58 of 72 statements. [2025-03-08 23:13:58,325 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 23:13:58,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:58,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 23:13:58,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 23:13:58,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 23:13:58,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930662561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:58,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-08 23:13:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765739455] [2025-03-08 23:13:58,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:58,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 23:13:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:58,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 23:13:58,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:13:58,513 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 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-08 23:13:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:58,675 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2025-03-08 23:13:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 23:13:58,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 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 72 [2025-03-08 23:13:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:58,676 INFO L225 Difference]: With dead ends: 156 [2025-03-08 23:13:58,676 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 23:13:58,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2025-03-08 23:13:58,676 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:58,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 50 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 23:13:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 135. [2025-03-08 23:13:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 134 states have internal predecessors, (150), 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-08 23:13:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2025-03-08 23:13:58,678 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 72 [2025-03-08 23:13:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:58,678 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2025-03-08 23:13:58,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 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-08 23:13:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2025-03-08 23:13:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 23:13:58,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:58,679 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:58,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 23:13:58,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 23:13:58,879 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:58,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2016337035, now seen corresponding path program 1 times [2025-03-08 23:13:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969385326] [2025-03-08 23:13:58,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:58,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 23:13:58,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 23:13:58,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:58,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 25 proven. 54 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 23:13:59,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:59,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969385326] [2025-03-08 23:13:59,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969385326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:59,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434294657] [2025-03-08 23:13:59,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:13:59,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:59,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:59,127 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:59,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 23:13:59,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 23:13:59,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 23:13:59,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:13:59,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:59,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 23:13:59,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:13:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 38 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 23:13:59,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:13:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 38 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 23:13:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434294657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:13:59,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:13:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 25 [2025-03-08 23:13:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125303559] [2025-03-08 23:13:59,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:13:59,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 23:13:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:13:59,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 23:13:59,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2025-03-08 23:13:59,379 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 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-08 23:13:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:13:59,585 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2025-03-08 23:13:59,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 23:13:59,585 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 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 79 [2025-03-08 23:13:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:13:59,586 INFO L225 Difference]: With dead ends: 149 [2025-03-08 23:13:59,586 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 23:13:59,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 23:13:59,586 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:13:59,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 141 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:13:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 23:13:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-08 23:13:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.118279569892473) internal successors, (104), 93 states have internal predecessors, (104), 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-08 23:13:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2025-03-08 23:13:59,588 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 79 [2025-03-08 23:13:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:13:59,588 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2025-03-08 23:13:59,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 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-08 23:13:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2025-03-08 23:13:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 23:13:59,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:13:59,588 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:13:59,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 23:13:59,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:59,789 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:13:59,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:13:59,789 INFO L85 PathProgramCache]: Analyzing trace with hash -868478570, now seen corresponding path program 2 times [2025-03-08 23:13:59,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:13:59,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002188377] [2025-03-08 23:13:59,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:59,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:13:59,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-08 23:13:59,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 23:13:59,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:13:59,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:13:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-08 23:13:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:13:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002188377] [2025-03-08 23:13:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002188377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:13:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812542710] [2025-03-08 23:13:59,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:13:59,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:13:59,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:13:59,968 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:13:59,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 23:14:00,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-08 23:14:00,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 23:14:00,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:14:00,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:00,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 23:14:00,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:14:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-08 23:14:00,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:14:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-08 23:14:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812542710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:14:00,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:14:00,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-08 23:14:00,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820247154] [2025-03-08 23:14:00,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:14:00,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 23:14:00,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:00,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 23:14:00,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-08 23:14:00,197 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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-08 23:14:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:00,219 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2025-03-08 23:14:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 23:14:00,220 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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 81 [2025-03-08 23:14:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:00,220 INFO L225 Difference]: With dead ends: 97 [2025-03-08 23:14:00,220 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 23:14:00,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-08 23:14:00,221 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:00,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 78 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 23:14:00,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 23:14:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.1157894736842104) internal successors, (106), 95 states have internal predecessors, (106), 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-08 23:14:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-03-08 23:14:00,222 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 81 [2025-03-08 23:14:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:00,222 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-03-08 23:14:00,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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-08 23:14:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-03-08 23:14:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 23:14:00,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:00,223 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:00,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 23:14:00,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 23:14:00,423 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 23:14:00,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:00,423 INFO L85 PathProgramCache]: Analyzing trace with hash 169081717, now seen corresponding path program 3 times [2025-03-08 23:14:00,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:00,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61279170] [2025-03-08 23:14:00,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:14:00,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:00,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 6 equivalence classes. [2025-03-08 23:14:00,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 83 statements. [2025-03-08 23:14:00,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 23:14:00,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 23:14:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:00,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61279170] [2025-03-08 23:14:00,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61279170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:14:00,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124207098] [2025-03-08 23:14:00,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:14:00,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:14:00,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:14:00,477 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:14:00,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 23:14:00,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 6 equivalence classes. [2025-03-08 23:14:00,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 83 statements. [2025-03-08 23:14:00,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 23:14:00,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:00,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:14:00,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:14:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 23:14:00,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:14:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 23:14:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124207098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:14:00,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:14:00,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 23:14:00,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695810077] [2025-03-08 23:14:00,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:14:00,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:14:00,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:00,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:14:00,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:14:00,680 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:00,751 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2025-03-08 23:14:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:14:00,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-08 23:14:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:00,751 INFO L225 Difference]: With dead ends: 95 [2025-03-08 23:14:00,751 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 23:14:00,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:14:00,752 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:00,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:14:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 23:14:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 23:14:00,753 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-08 23:14:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 23:14:00,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2025-03-08 23:14:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:00,753 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 23:14:00,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 23:14:00,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (16 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-03-08 23:14:00,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-03-08 23:14:00,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-03-08 23:14:00,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 23:14:00,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:14:00,958 INFO L422 BasicCegarLoop]: Path program histogram: [6, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:00,960 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 23:14:00,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:14:00 BoogieIcfgContainer [2025-03-08 23:14:00,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 23:14:00,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 23:14:00,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 23:14:00,963 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 23:14:00,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:13:40" (3/4) ... [2025-03-08 23:14:00,966 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 23:14:00,974 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-08 23:14:00,975 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 23:14:00,975 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 23:14:00,975 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 23:14:01,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 23:14:01,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 23:14:01,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 23:14:01,039 INFO L158 Benchmark]: Toolchain (without parser) took 20645.21ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 132.7MB in the beginning and 247.9MB in the end (delta: -115.2MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2025-03-08 23:14:01,040 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:01,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.23ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 121.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:01,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.61ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 120.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:01,040 INFO L158 Benchmark]: Boogie Preprocessor took 27.66ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:01,041 INFO L158 Benchmark]: IcfgBuilder took 288.90ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 101.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 23:14:01,041 INFO L158 Benchmark]: TraceAbstraction took 20044.28ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 101.5MB in the beginning and 255.1MB in the end (delta: -153.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:01,041 INFO L158 Benchmark]: Witness Printer took 75.93ms. Allocated memory is still 293.6MB. Free memory was 255.1MB in the beginning and 247.9MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:01,042 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.45ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.23ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 121.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.61ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 120.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.66ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 288.90ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 101.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20044.28ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 101.5MB in the beginning and 255.1MB in the end (delta: -153.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 75.93ms. Allocated memory is still 293.6MB. Free memory was 255.1MB in the beginning and 247.9MB in the end (delta: 7.2MB). 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: 28]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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 - 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, 49 locations, 61 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 30, TraceHistogramMax: 6, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2323 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2323 mSDsluCounter, 2882 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2182 mSDsCounter, 402 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7096 IncrementalHoareTripleChecker+Invalid, 7498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 402 mSolverCounterUnsat, 700 mSDtfsCounter, 7096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2370 GetRequests, 1810 SyntacticMatches, 25 SemanticMatches, 535 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4389 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=19, InterpolantAutomatonStates: 365, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 755 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2324 NumberOfCodeBlocks, 2051 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 3249 ConstructedInterpolants, 0 QuantifiedInterpolants, 19168 SizeOfPredicates, 50 NumberOfNonLiveVariables, 4686 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 70 InterpolantComputations, 11 PerfectInterpolantSequences, 4848/5499 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 23:14:01,055 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