./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/960521-1_1-2.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/list-ext-properties/960521-1_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b468f3c6542f32922018ecd35f248815c64c681a62a7333b987abbfb42d9345 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:46:06,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:46:06,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:46:06,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:46:06,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:46:06,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:46:06,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:46:06,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:46:06,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:46:06,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:46:06,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:46:06,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:46:06,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:46:06,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:46:06,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:46:06,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:46:06,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:46:06,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:46:06,448 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 -> 2b468f3c6542f32922018ecd35f248815c64c681a62a7333b987abbfb42d9345 [2025-03-08 22:46:06,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:46:06,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:46:06,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:46:06,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:46:06,667 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:46:06,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/960521-1_1-2.i [2025-03-08 22:46:07,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c486518c/f688da732ffd47b5ace4adc8ab4378e5/FLAGbd59f7c20 [2025-03-08 22:46:08,012 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:46:08,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/960521-1_1-2.i [2025-03-08 22:46:08,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c486518c/f688da732ffd47b5ace4adc8ab4378e5/FLAGbd59f7c20 [2025-03-08 22:46:08,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c486518c/f688da732ffd47b5ace4adc8ab4378e5 [2025-03-08 22:46:08,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:46:08,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:46:08,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:46:08,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:46:08,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:46:08,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08, skipping insertion in model container [2025-03-08 22:46:08,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:46:08,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:46:08,579 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:46:08,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:46:08,624 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:46:08,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08 WrapperNode [2025-03-08 22:46:08,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:46:08,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:46:08,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:46:08,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:46:08,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,648 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2025-03-08 22:46:08,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:46:08,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:46:08,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:46:08,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:46:08,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,665 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 4, 1]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-08 22:46:08,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,669 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:46:08,674 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:46:08,674 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:46:08,674 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:46:08,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (1/1) ... [2025-03-08 22:46:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:46:08,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:08,699 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 22:46:08,701 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 22:46:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:46:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:46:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:46:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:46:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:46:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:46:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:46:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:46:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:46:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:46:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:46:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:46:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:46:08,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:46:08,784 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:46:08,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:46:08,948 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 22:46:08,952 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:46:08,959 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:46:08,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:46:08,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:08 BoogieIcfgContainer [2025-03-08 22:46:08,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:46:08,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:46:08,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:46:08,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:46:08,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:46:08" (1/3) ... [2025-03-08 22:46:08,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e60758d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:08, skipping insertion in model container [2025-03-08 22:46:08,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:08" (2/3) ... [2025-03-08 22:46:08,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e60758d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:08, skipping insertion in model container [2025-03-08 22:46:08,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:08" (3/3) ... [2025-03-08 22:46:08,968 INFO L128 eAbstractionObserver]: Analyzing ICFG 960521-1_1-2.i [2025-03-08 22:46:08,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:46:08,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 960521-1_1-2.i that has 1 procedures, 56 locations, 1 initial locations, 3 loop locations, and 23 error locations. [2025-03-08 22:46:09,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:46:09,025 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;@2851b9dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:46:09,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-08 22:46:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 32 states have (on average 1.875) internal successors, (60), 55 states have internal predecessors, (60), 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 22:46:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:46:09,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:09,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:46:09,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:09,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash 86809785, now seen corresponding path program 1 times [2025-03-08 22:46:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557369592] [2025-03-08 22:46:09,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:09,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:46:09,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:46:09,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:09,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:09,144 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 22:46:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:09,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557369592] [2025-03-08 22:46:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557369592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:09,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:09,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855620889] [2025-03-08 22:46:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:09,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:46:09,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:09,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:46:09,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:46:09,170 INFO L87 Difference]: Start difference. First operand has 56 states, 32 states have (on average 1.875) internal successors, (60), 55 states have internal predecessors, (60), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 22:46:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:09,179 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2025-03-08 22:46:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:46:09,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-03-08 22:46:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:09,186 INFO L225 Difference]: With dead ends: 56 [2025-03-08 22:46:09,186 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 22:46:09,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:46:09,190 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:09,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 22:46:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 22:46:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 53 states have internal predecessors, (57), 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 22:46:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2025-03-08 22:46:09,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 5 [2025-03-08 22:46:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:09,213 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2025-03-08 22:46:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 22:46:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2025-03-08 22:46:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:46:09,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:09,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:46:09,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:46:09,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:09,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:09,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1603890756, now seen corresponding path program 1 times [2025-03-08 22:46:09,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:09,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546009351] [2025-03-08 22:46:09,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:09,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:46:09,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:46:09,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:09,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:09,323 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 22:46:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546009351] [2025-03-08 22:46:09,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546009351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:09,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:09,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385000432] [2025-03-08 22:46:09,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:09,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:46:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:09,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:46:09,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:46:09,327 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:09,370 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-03-08 22:46:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:46:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:09,371 INFO L225 Difference]: With dead ends: 53 [2025-03-08 22:46:09,371 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 22:46:09,372 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 22:46:09,372 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:09,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 22:46:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 22:46:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 52 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 22:46:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2025-03-08 22:46:09,378 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 6 [2025-03-08 22:46:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:09,379 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2025-03-08 22:46:09,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2025-03-08 22:46:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:46:09,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:09,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:46:09,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:46:09,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:09,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1603890755, now seen corresponding path program 1 times [2025-03-08 22:46:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:09,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286336800] [2025-03-08 22:46:09,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:09,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:09,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:46:09,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:46:09,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:09,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:09,520 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 22:46:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:09,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286336800] [2025-03-08 22:46:09,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286336800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:09,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:09,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776645934] [2025-03-08 22:46:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:09,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:09,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:09,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:09,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:09,522 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:09,617 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2025-03-08 22:46:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:09,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:46:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:09,620 INFO L225 Difference]: With dead ends: 103 [2025-03-08 22:46:09,621 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 22:46:09,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:09,622 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:09,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 122 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 22:46:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 57. [2025-03-08 22:46:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 56 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 22:46:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-03-08 22:46:09,628 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 6 [2025-03-08 22:46:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:09,629 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-03-08 22:46:09,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-03-08 22:46:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:46:09,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:09,630 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:09,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:46:09,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:09,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash 555321724, now seen corresponding path program 1 times [2025-03-08 22:46:09,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:09,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-08 22:46:09,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:09,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:46:09,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:46:09,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:09,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:09,765 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 22:46:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-08 22:46:09,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109407212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362403492] [2025-03-08 22:46:09,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:09,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:09,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:09,769 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 22:46:09,770 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 22:46:09,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:46:09,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:46:09,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:09,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:09,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:46:09,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:09,902 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 22:46:09,913 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 22:46:09,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:09,971 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 22:46:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362403492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:09,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:09,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-08 22:46:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228833168] [2025-03-08 22:46:09,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:09,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:46:09,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:09,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:46:09,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:46:09,974 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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 22:46:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:10,146 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2025-03-08 22:46:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:46:10,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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 8 [2025-03-08 22:46:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:10,150 INFO L225 Difference]: With dead ends: 152 [2025-03-08 22:46:10,151 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 22:46:10,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:46:10,152 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 202 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:10,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 392 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 22:46:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 52. [2025-03-08 22:46:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 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 22:46:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-03-08 22:46:10,160 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 8 [2025-03-08 22:46:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:10,161 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-03-08 22:46:10,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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 22:46:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-03-08 22:46:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:46:10,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:10,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:10,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:46:10,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:10,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1674836, now seen corresponding path program 1 times [2025-03-08 22:46:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729601047] [2025-03-08 22:46:10,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:10,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:46:10,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:46:10,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:10,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:10,434 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 22:46:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729601047] [2025-03-08 22:46:10,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729601047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:10,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:10,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603276118] [2025-03-08 22:46:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:10,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:10,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:10,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:10,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:10,436 INFO L87 Difference]: Start difference. First operand 52 states and 55 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 22:46:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:10,467 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2025-03-08 22:46:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:10,468 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 9 [2025-03-08 22:46:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:10,468 INFO L225 Difference]: With dead ends: 49 [2025-03-08 22:46:10,468 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 22:46:10,468 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 22:46:10,469 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 54 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:10,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 49 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 22:46:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 22:46:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 48 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 22:46:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2025-03-08 22:46:10,471 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2025-03-08 22:46:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:10,471 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2025-03-08 22:46:10,471 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 22:46:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2025-03-08 22:46:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:46:10,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:10,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:10,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:46:10,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:10,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1674837, now seen corresponding path program 1 times [2025-03-08 22:46:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310578262] [2025-03-08 22:46:10,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:10,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:10,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:46:10,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:46:10,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:10,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:10,668 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 22:46:10,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:10,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310578262] [2025-03-08 22:46:10,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310578262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:10,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:10,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192980331] [2025-03-08 22:46:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:10,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:10,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:10,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:10,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:10,670 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 22:46:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:10,734 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-03-08 22:46:10,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:10,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:46:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:10,735 INFO L225 Difference]: With dead ends: 54 [2025-03-08 22:46:10,735 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 22:46:10,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:10,735 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 61 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:10,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 72 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 22:46:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2025-03-08 22:46:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.606060606060606) internal successors, (53), 48 states have internal predecessors, (53), 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 22:46:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-03-08 22:46:10,738 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 9 [2025-03-08 22:46:10,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:10,738 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-03-08 22:46:10,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 22:46:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-03-08 22:46:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:46:10,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:10,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:10,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:46:10,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:10,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:10,739 INFO L85 PathProgramCache]: Analyzing trace with hash 51914995, now seen corresponding path program 1 times [2025-03-08 22:46:10,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:10,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202788762] [2025-03-08 22:46:10,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:10,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:10,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:46:10,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:46:10,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:10,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:10,785 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 22:46:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:10,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202788762] [2025-03-08 22:46:10,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202788762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:10,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:10,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:46:10,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988296115] [2025-03-08 22:46:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:10,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:10,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:10,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:10,786 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.5) 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 22:46:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:10,819 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2025-03-08 22:46:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:10,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) 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 10 [2025-03-08 22:46:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:10,820 INFO L225 Difference]: With dead ends: 93 [2025-03-08 22:46:10,820 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 22:46:10,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:10,820 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 42 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:10,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 137 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 22:46:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 60. [2025-03-08 22:46:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 59 states have internal predecessors, (67), 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 22:46:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2025-03-08 22:46:10,826 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 10 [2025-03-08 22:46:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:10,826 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2025-03-08 22:46:10,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) 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 22:46:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2025-03-08 22:46:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:46:10,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:10,826 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:10,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:46:10,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:10,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1644554248, now seen corresponding path program 1 times [2025-03-08 22:46:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84491901] [2025-03-08 22:46:10,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:10,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:46:10,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:46:10,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:10,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:10,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:10,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84491901] [2025-03-08 22:46:10,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84491901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:10,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267004906] [2025-03-08 22:46:10,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:10,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:10,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:10,891 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 22:46:10,894 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 22:46:10,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:46:10,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:46:10,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:10,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:10,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:46:10,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:10,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267004906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 22:46:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819565918] [2025-03-08 22:46:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:10,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:10,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:10,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:10,993 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:11,034 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2025-03-08 22:46:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:11,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:46:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:11,035 INFO L225 Difference]: With dead ends: 90 [2025-03-08 22:46:11,035 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 22:46:11,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:11,036 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 32 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:11,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 224 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 22:46:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2025-03-08 22:46:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 58 states have internal predecessors, (64), 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 22:46:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-03-08 22:46:11,038 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 12 [2025-03-08 22:46:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:11,038 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-03-08 22:46:11,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-03-08 22:46:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:46:11,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:11,038 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:11,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:46:11,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 22:46:11,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:11,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2113612082, now seen corresponding path program 1 times [2025-03-08 22:46:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:11,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726016132] [2025-03-08 22:46:11,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:11,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:46:11,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:46:11,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:11,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:46:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:11,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726016132] [2025-03-08 22:46:11,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726016132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:11,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:11,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:11,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800624447] [2025-03-08 22:46:11,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:11,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:11,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:11,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:11,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:11,272 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:11,312 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-03-08 22:46:11,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:11,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:46:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:11,313 INFO L225 Difference]: With dead ends: 56 [2025-03-08 22:46:11,313 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 22:46:11,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:11,313 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:11,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 69 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 22:46:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 22:46:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 55 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 22:46:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-03-08 22:46:11,315 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 12 [2025-03-08 22:46:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:11,315 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-03-08 22:46:11,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-03-08 22:46:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:46:11,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:11,316 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:11,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:46:11,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:11,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2113612083, now seen corresponding path program 1 times [2025-03-08 22:46:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:11,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637601641] [2025-03-08 22:46:11,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:11,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:46:11,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:46:11,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:11,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:11,364 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 22:46:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637601641] [2025-03-08 22:46:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637601641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657358553] [2025-03-08 22:46:11,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:11,366 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 22:46:11,368 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 22:46:11,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:46:11,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:46:11,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:11,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:11,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:46:11,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:11,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:11,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657358553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:11,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:11,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-08 22:46:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149986370] [2025-03-08 22:46:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:11,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:11,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:11,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:11,432 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:11,472 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2025-03-08 22:46:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:46:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:11,473 INFO L225 Difference]: With dead ends: 89 [2025-03-08 22:46:11,473 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 22:46:11,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:11,475 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 88 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:11,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 119 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 22:46:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2025-03-08 22:46:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 56 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 22:46:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-03-08 22:46:11,477 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2025-03-08 22:46:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:11,477 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-03-08 22:46:11,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-03-08 22:46:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:46:11,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:11,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:11,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:11,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:11,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 131179991, now seen corresponding path program 1 times [2025-03-08 22:46:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642008966] [2025-03-08 22:46:11,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:11,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:46:11,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:46:11,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:11,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642008966] [2025-03-08 22:46:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642008966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:46:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348479640] [2025-03-08 22:46:11,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:11,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:11,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:11,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:11,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:11,791 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:11,830 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2025-03-08 22:46:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:46:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:11,830 INFO L225 Difference]: With dead ends: 52 [2025-03-08 22:46:11,830 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 22:46:11,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:11,831 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:11,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 22:46:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 22:46:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 51 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 22:46:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-03-08 22:46:11,832 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2025-03-08 22:46:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:11,833 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-03-08 22:46:11,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-03-08 22:46:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:46:11,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:11,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:11,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:46:11,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:11,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash -333577097, now seen corresponding path program 1 times [2025-03-08 22:46:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764418789] [2025-03-08 22:46:11,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:11,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:46:11,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:46:11,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:11,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:12,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:12,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764418789] [2025-03-08 22:46:12,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764418789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:12,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553460687] [2025-03-08 22:46:12,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:12,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:12,053 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 22:46:12,054 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 22:46:12,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:46:12,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:46:12,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:12,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:12,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:46:12,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:12,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:46:12,129 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 11 treesize of output 5 [2025-03-08 22:46:12,137 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 10 treesize of output 8 [2025-03-08 22:46:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:12,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:12,294 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:46:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:12,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553460687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:12,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:12,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2025-03-08 22:46:12,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875312389] [2025-03-08 22:46:12,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:12,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:46:12,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:12,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:46:12,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:46:12,329 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:12,774 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2025-03-08 22:46:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:46:12,774 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:46:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:12,775 INFO L225 Difference]: With dead ends: 129 [2025-03-08 22:46:12,775 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 22:46:12,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:46:12,776 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 347 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:12,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 318 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 22:46:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 71. [2025-03-08 22:46:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 70 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 22:46:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-03-08 22:46:12,784 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 14 [2025-03-08 22:46:12,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:12,784 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-08 22:46:12,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2025-03-08 22:46:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:46:12,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:12,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:12,797 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 22:46:12,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:12,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:12,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:12,986 INFO L85 PathProgramCache]: Analyzing trace with hash -228387605, now seen corresponding path program 1 times [2025-03-08 22:46:12,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:12,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948944698] [2025-03-08 22:46:12,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:12,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:12,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:46:12,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:46:12,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:12,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:13,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948944698] [2025-03-08 22:46:13,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948944698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:13,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231460050] [2025-03-08 22:46:13,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:13,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:13,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:13,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:13,099 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:13,158 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2025-03-08 22:46:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 22:46:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:13,159 INFO L225 Difference]: With dead ends: 94 [2025-03-08 22:46:13,159 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 22:46:13,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:13,159 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:13,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 85 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 22:46:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2025-03-08 22:46:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2025-03-08 22:46:13,168 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 15 [2025-03-08 22:46:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:13,168 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2025-03-08 22:46:13,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2025-03-08 22:46:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:46:13,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:13,169 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:13,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:46:13,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:13,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 959010454, now seen corresponding path program 2 times [2025-03-08 22:46:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:13,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017194477] [2025-03-08 22:46:13,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:13,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 22:46:13,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:46:13,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:13,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:13,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017194477] [2025-03-08 22:46:13,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017194477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680739701] [2025-03-08 22:46:13,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:13,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:13,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:13,249 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 22:46:13,250 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 22:46:13,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 22:46:13,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:46:13,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:13,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:13,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:46:13,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:13,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:13,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680739701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:13,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:13,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-08 22:46:13,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601540091] [2025-03-08 22:46:13,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:13,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:46:13,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:13,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:46:13,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:46:13,398 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:13,486 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2025-03-08 22:46:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:46:13,486 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 22:46:13,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:13,486 INFO L225 Difference]: With dead ends: 118 [2025-03-08 22:46:13,487 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 22:46:13,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:46:13,487 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:13,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 150 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 22:46:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 79. [2025-03-08 22:46:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 78 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-03-08 22:46:13,490 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 17 [2025-03-08 22:46:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:13,490 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-03-08 22:46:13,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-03-08 22:46:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:46:13,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:13,490 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:13,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:46:13,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 22:46:13,695 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:13,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash -568277453, now seen corresponding path program 1 times [2025-03-08 22:46:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:13,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722811207] [2025-03-08 22:46:13,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:13,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:13,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:46:13,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:46:13,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:13,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:46:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:13,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722811207] [2025-03-08 22:46:13,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722811207] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:13,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695464957] [2025-03-08 22:46:13,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:13,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:13,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:13,744 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 22:46:13,745 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 22:46:13,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:46:13,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:46:13,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:13,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:13,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:46:13,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:13,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695464957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:13,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:13,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-03-08 22:46:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734357454] [2025-03-08 22:46:13,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:13,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:46:13,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:13,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:46:13,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:13,883 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 22:46:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:14,061 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2025-03-08 22:46:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:46:14,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 17 [2025-03-08 22:46:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:14,063 INFO L225 Difference]: With dead ends: 125 [2025-03-08 22:46:14,063 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 22:46:14,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:46:14,064 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 168 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:14,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 409 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 22:46:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 84. [2025-03-08 22:46:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 83 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 22:46:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2025-03-08 22:46:14,070 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 17 [2025-03-08 22:46:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:14,070 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2025-03-08 22:46:14,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 22:46:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2025-03-08 22:46:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:46:14,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:14,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:14,077 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 22:46:14,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 22:46:14,275 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:14,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash -666987450, now seen corresponding path program 1 times [2025-03-08 22:46:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:14,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117471825] [2025-03-08 22:46:14,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:14,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:46:14,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:46:14,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:14,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:14,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:14,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117471825] [2025-03-08 22:46:14,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117471825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:14,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:14,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:14,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780526614] [2025-03-08 22:46:14,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:14,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:46:14,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:14,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:46:14,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:46:14,304 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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 22:46:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:14,313 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-03-08 22:46:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:14,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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 18 [2025-03-08 22:46:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:14,314 INFO L225 Difference]: With dead ends: 82 [2025-03-08 22:46:14,314 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 22:46:14,314 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 22:46:14,315 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:14,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 22:46:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-08 22:46:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 81 states have internal predecessors, (89), 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 22:46:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2025-03-08 22:46:14,317 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 18 [2025-03-08 22:46:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:14,317 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2025-03-08 22:46:14,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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 22:46:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2025-03-08 22:46:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:46:14,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:14,317 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:14,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:46:14,319 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:14,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:14,319 INFO L85 PathProgramCache]: Analyzing trace with hash -335451949, now seen corresponding path program 2 times [2025-03-08 22:46:14,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:14,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633230459] [2025-03-08 22:46:14,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:14,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 22:46:14,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:46:14,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:14,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:46:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633230459] [2025-03-08 22:46:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633230459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420576568] [2025-03-08 22:46:14,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:14,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:14,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:14,545 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 22:46:14,546 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 22:46:14,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 22:46:14,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:46:14,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:14,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:14,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 22:46:14,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:14,613 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 10 treesize of output 8 [2025-03-08 22:46:14,647 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 22:46:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:46:14,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:46:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420576568] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:46:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 17 [2025-03-08 22:46:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461591546] [2025-03-08 22:46:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:15,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:46:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:15,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:46:15,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:46:15,072 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 22:46:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:15,207 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2025-03-08 22:46:15,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:15,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 22:46:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:15,208 INFO L225 Difference]: With dead ends: 94 [2025-03-08 22:46:15,208 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 22:46:15,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:46:15,209 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 89 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:15,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 53 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 22:46:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2025-03-08 22:46:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2025-03-08 22:46:15,210 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 18 [2025-03-08 22:46:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:15,211 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2025-03-08 22:46:15,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 22:46:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2025-03-08 22:46:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:46:15,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:15,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:15,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:46:15,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:15,413 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:15,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash -649043593, now seen corresponding path program 3 times [2025-03-08 22:46:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:15,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605936155] [2025-03-08 22:46:15,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:15,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-08 22:46:15,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 19 statements. [2025-03-08 22:46:15,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:46:15,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:46:15,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605936155] [2025-03-08 22:46:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605936155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158342033] [2025-03-08 22:46:15,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:15,569 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 22:46:15,571 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 22:46:15,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-08 22:46:15,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 19 statements. [2025-03-08 22:46:15,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:46:15,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:15,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:46:15,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:15,643 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-08 22:46:15,643 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 1 case distinctions, treesize of input 17 treesize of output 19 [2025-03-08 22:46:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:46:15,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:46:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158342033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:16,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-08 22:46:16,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996826658] [2025-03-08 22:46:16,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:16,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:46:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:16,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:46:16,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:46:16,063 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 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 22:46:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:16,258 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-03-08 22:46:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:46:16,258 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 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 19 [2025-03-08 22:46:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:16,259 INFO L225 Difference]: With dead ends: 81 [2025-03-08 22:46:16,259 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 22:46:16,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:46:16,259 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:16,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 94 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:16,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 22:46:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 22:46:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.162162162162162) internal successors, (86), 80 states have internal predecessors, (86), 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 22:46:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2025-03-08 22:46:16,261 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 19 [2025-03-08 22:46:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:16,261 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2025-03-08 22:46:16,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 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 22:46:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2025-03-08 22:46:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:46:16,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:16,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:16,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:16,462 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,SelfDestructingSolverStorable17 [2025-03-08 22:46:16,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:16,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1024812988, now seen corresponding path program 1 times [2025-03-08 22:46:16,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:16,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570953424] [2025-03-08 22:46:16,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:16,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 22:46:16,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:46:16,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:16,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:16,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570953424] [2025-03-08 22:46:16,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570953424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:16,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:16,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:46:16,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013887822] [2025-03-08 22:46:16,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:16,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:16,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:16,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:16,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:16,555 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 22:46:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:16,599 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2025-03-08 22:46:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:46:16,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2025-03-08 22:46:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:16,599 INFO L225 Difference]: With dead ends: 88 [2025-03-08 22:46:16,599 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 22:46:16,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:16,600 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:16,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 22:46:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2025-03-08 22:46:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 80 states have internal predecessors, (85), 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 22:46:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-03-08 22:46:16,601 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 20 [2025-03-08 22:46:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:16,601 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-03-08 22:46:16,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 22:46:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-03-08 22:46:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:46:16,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:16,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:16,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:46:16,602 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:16,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1319846652, now seen corresponding path program 1 times [2025-03-08 22:46:16,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:16,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924242572] [2025-03-08 22:46:16,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:16,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:46:16,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:46:16,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:16,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:16,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924242572] [2025-03-08 22:46:16,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924242572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:16,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:16,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116298231] [2025-03-08 22:46:16,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:16,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:16,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:16,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:16,630 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:16,656 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2025-03-08 22:46:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:16,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 22:46:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:16,656 INFO L225 Difference]: With dead ends: 80 [2025-03-08 22:46:16,657 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 22:46:16,657 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 22:46:16,657 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:16,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 22:46:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 22:46:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.135135135135135) internal successors, (84), 79 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 22:46:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2025-03-08 22:46:16,660 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 21 [2025-03-08 22:46:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:16,661 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-03-08 22:46:16,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2025-03-08 22:46:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:46:16,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:16,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:16,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:46:16,661 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:16,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2034426735, now seen corresponding path program 1 times [2025-03-08 22:46:16,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:16,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12094459] [2025-03-08 22:46:16,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:16,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:16,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:46:16,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:46:16,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:16,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:16,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:16,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12094459] [2025-03-08 22:46:16,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12094459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:16,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:16,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:46:16,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612283042] [2025-03-08 22:46:16,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:16,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:16,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:16,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:16,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:16,766 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 22:46:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:16,794 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2025-03-08 22:46:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:16,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 22 [2025-03-08 22:46:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:16,795 INFO L225 Difference]: With dead ends: 79 [2025-03-08 22:46:16,795 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 22:46:16,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:16,796 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:16,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 46 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 22:46:16,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 22:46:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 78 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 22:46:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2025-03-08 22:46:16,799 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 22 [2025-03-08 22:46:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:16,800 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2025-03-08 22:46:16,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 22:46:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2025-03-08 22:46:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:46:16,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:16,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:16,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:46:16,800 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:16,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:16,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1264679501, now seen corresponding path program 1 times [2025-03-08 22:46:16,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:16,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193086714] [2025-03-08 22:46:16,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:16,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:16,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:46:16,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:46:16,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:16,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:46:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193086714] [2025-03-08 22:46:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193086714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039062390] [2025-03-08 22:46:16,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:16,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:16,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:16,878 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 22:46:16,879 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 22:46:16,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:46:16,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:46:16,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:16,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:16,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:46:16,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:46:16,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:17,039 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 30 treesize of output 26 [2025-03-08 22:46:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:46:17,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039062390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:17,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:17,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-03-08 22:46:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998396497] [2025-03-08 22:46:17,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:17,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:46:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:17,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:46:17,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:46:17,107 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:17,289 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2025-03-08 22:46:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:46:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 22:46:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:17,290 INFO L225 Difference]: With dead ends: 103 [2025-03-08 22:46:17,290 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 22:46:17,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:46:17,291 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 145 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:17,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 185 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 22:46:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2025-03-08 22:46:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 81 states have internal predecessors, (86), 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 22:46:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2025-03-08 22:46:17,293 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 23 [2025-03-08 22:46:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:17,293 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2025-03-08 22:46:17,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2025-03-08 22:46:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:46:17,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:17,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:17,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:17,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:17,499 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:17,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash 873971788, now seen corresponding path program 1 times [2025-03-08 22:46:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282789071] [2025-03-08 22:46:17,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:17,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:46:17,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:46:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:17,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282789071] [2025-03-08 22:46:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282789071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:17,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:17,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237134654] [2025-03-08 22:46:17,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:17,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:17,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:17,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:17,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:17,602 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:17,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:17,646 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2025-03-08 22:46:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:17,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 22:46:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:17,648 INFO L225 Difference]: With dead ends: 81 [2025-03-08 22:46:17,648 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 22:46:17,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:17,649 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:17,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 72 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 22:46:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 22:46:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 60 states have internal predecessors, (64), 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 22:46:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-08 22:46:17,651 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 24 [2025-03-08 22:46:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:17,651 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-08 22:46:17,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-08 22:46:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:46:17,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:17,652 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:17,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:46:17,652 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:17,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1004547219, now seen corresponding path program 1 times [2025-03-08 22:46:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-03-08 22:46:17,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:17,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:17,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:46:17,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:46:17,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:17,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:46:17,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:17,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-03-08 22:46:17,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233099860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:17,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560617554] [2025-03-08 22:46:17,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:17,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:17,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:17,871 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 22:46:17,872 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 22:46:17,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:46:17,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:46:17,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:17,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:17,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 22:46:17,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:17,945 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 22:46:17,945 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 1 case distinctions, treesize of input 13 treesize of output 15 [2025-03-08 22:46:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:46:18,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:46:18,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560617554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:18,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:18,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-03-08 22:46:18,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145585933] [2025-03-08 22:46:18,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:18,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 22:46:18,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:18,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 22:46:18,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:46:18,532 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 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 22:46:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:19,089 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2025-03-08 22:46:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:46:19,090 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 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 26 [2025-03-08 22:46:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:19,090 INFO L225 Difference]: With dead ends: 73 [2025-03-08 22:46:19,090 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 22:46:19,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 22:46:19,091 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 132 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:19,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 89 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 22:46:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2025-03-08 22:46:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 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 22:46:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-08 22:46:19,093 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 26 [2025-03-08 22:46:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:19,093 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-08 22:46:19,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 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 22:46:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-08 22:46:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:46:19,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:19,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:19,100 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 22:46:19,298 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,SelfDestructingSolverStorable23 [2025-03-08 22:46:19,298 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:19,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1499349026, now seen corresponding path program 1 times [2025-03-08 22:46:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:19,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941039316] [2025-03-08 22:46:19,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:19,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:46:19,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:46:19,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:19,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:19,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:19,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941039316] [2025-03-08 22:46:19,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941039316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:19,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406960763] [2025-03-08 22:46:19,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:19,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:19,626 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 22:46:19,628 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 22:46:19,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:46:19,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:46:19,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:19,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:19,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 22:46:19,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:19,704 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 11 treesize of output 7 [2025-03-08 22:46:19,823 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 22:46:19,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:46:19,921 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:46:19,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:19,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2025-03-08 22:46:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:46:19,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:20,078 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-03-08 22:46:20,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 82 [2025-03-08 22:46:20,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:20,089 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 82 treesize of output 82 [2025-03-08 22:46:20,097 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 6 treesize of output 4 [2025-03-08 22:46:20,124 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-08 22:46:20,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 72 [2025-03-08 22:46:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:46:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406960763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:20,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:20,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-03-08 22:46:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531105533] [2025-03-08 22:46:20,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:20,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 22:46:20,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:20,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 22:46:20,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:46:20,252 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 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 22:46:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:20,670 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2025-03-08 22:46:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:46:20,671 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 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) Word has length 28 [2025-03-08 22:46:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:20,671 INFO L225 Difference]: With dead ends: 58 [2025-03-08 22:46:20,671 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 22:46:20,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 22:46:20,672 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:20,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 147 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 22:46:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 22:46:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-03-08 22:46:20,673 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 28 [2025-03-08 22:46:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:20,673 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-03-08 22:46:20,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 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 22:46:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-03-08 22:46:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:46:20,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:20,674 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:20,680 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 22:46:20,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 22:46:20,874 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:20,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash -865940013, now seen corresponding path program 2 times [2025-03-08 22:46:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:20,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-03-08 22:46:20,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:20,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 22:46:20,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:46:20,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:20,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:46:20,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:20,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-03-08 22:46:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253107391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:20,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672056610] [2025-03-08 22:46:20,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:20,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:20,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:20,947 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 22:46:20,949 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 22:46:20,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 22:46:21,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:46:21,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:21,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:21,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:46:21,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:46:21,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:46:21,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672056610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:21,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:21,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-08 22:46:21,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688502289] [2025-03-08 22:46:21,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:21,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:46:21,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:21,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:46:21,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:21,103 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:21,183 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2025-03-08 22:46:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:46:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 22:46:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:21,183 INFO L225 Difference]: With dead ends: 72 [2025-03-08 22:46:21,183 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 22:46:21,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:21,184 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:21,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 22:46:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2025-03-08 22:46:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.11864406779661) internal successors, (66), 61 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 22:46:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-03-08 22:46:21,185 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 29 [2025-03-08 22:46:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:21,185 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-03-08 22:46:21,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-03-08 22:46:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:46:21,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:21,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:21,192 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 22:46:21,386 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,SelfDestructingSolverStorable25 [2025-03-08 22:46:21,386 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:21,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1055329933, now seen corresponding path program 2 times [2025-03-08 22:46:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:21,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711101529] [2025-03-08 22:46:21,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:21,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 22:46:21,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:46:21,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:21,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:46:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711101529] [2025-03-08 22:46:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711101529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371448153] [2025-03-08 22:46:21,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:21,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:21,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:21,481 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 22:46:21,483 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 22:46:21,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 22:46:21,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:46:21,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:21,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:21,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:46:21,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:46:21,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:21,658 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 30 treesize of output 26 [2025-03-08 22:46:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:46:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371448153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:21,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:21,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-08 22:46:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312040161] [2025-03-08 22:46:21,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:21,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:46:21,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:21,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:46:21,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:46:21,767 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 20 states, 19 states have (on average 3.473684210526316) internal successors, (66), 20 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 22:46:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:21,904 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2025-03-08 22:46:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:46:21,904 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.473684210526316) internal successors, (66), 20 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 31 [2025-03-08 22:46:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:21,904 INFO L225 Difference]: With dead ends: 71 [2025-03-08 22:46:21,905 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 22:46:21,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:46:21,905 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:21,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 22:46:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-03-08 22:46:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 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 22:46:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-03-08 22:46:21,907 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 31 [2025-03-08 22:46:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:21,907 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-03-08 22:46:21,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.473684210526316) internal successors, (66), 20 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 22:46:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-03-08 22:46:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:46:21,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:21,907 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:21,913 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 22:46:22,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 22:46:22,108 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:22,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash 695439156, now seen corresponding path program 3 times [2025-03-08 22:46:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:22,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-08 22:46:22,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:22,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:22,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-08 22:46:22,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 31 statements. [2025-03-08 22:46:22,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:46:22,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 22:46:22,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:22,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-08 22:46:22,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666796419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:22,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373357708] [2025-03-08 22:46:22,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:22,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:22,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:22,234 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 22:46:22,236 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 22:46:22,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-08 22:46:22,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 31 statements. [2025-03-08 22:46:22,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:46:22,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:22,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:46:22,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:22,302 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 22:46:22,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:46:22,314 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 10 treesize of output 8 [2025-03-08 22:46:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 22:46:22,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 22:46:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373357708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:22,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-08 22:46:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280296098] [2025-03-08 22:46:22,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:22,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:46:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:22,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:46:22,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:46:22,882 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 22 states have internal predecessors, (54), 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 22:46:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:23,153 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2025-03-08 22:46:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:46:23,153 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 22 states have internal predecessors, (54), 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 31 [2025-03-08 22:46:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:23,153 INFO L225 Difference]: With dead ends: 64 [2025-03-08 22:46:23,153 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 22:46:23,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2025-03-08 22:46:23,154 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:23,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 19 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 22:46:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-03-08 22:46:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.098360655737705) internal successors, (67), 62 states have internal predecessors, (67), 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 22:46:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-03-08 22:46:23,155 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2025-03-08 22:46:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:23,155 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-03-08 22:46:23,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 22 states have internal predecessors, (54), 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 22:46:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-03-08 22:46:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:46:23,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:23,156 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:23,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:23,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:23,356 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:23,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1697842258, now seen corresponding path program 3 times [2025-03-08 22:46:23,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115672307] [2025-03-08 22:46:23,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:23,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-03-08 22:46:23,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 33 statements. [2025-03-08 22:46:23,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:46:23,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 22:46:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115672307] [2025-03-08 22:46:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115672307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249112083] [2025-03-08 22:46:23,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:23,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:23,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:23,428 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 22:46:23,429 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 22:46:23,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-03-08 22:46:23,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 33 statements. [2025-03-08 22:46:23,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:46:23,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:23,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:46:23,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 22:46:23,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:23,611 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 11 treesize of output 9 [2025-03-08 22:46:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 22:46:23,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249112083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:23,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:23,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-08 22:46:23,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421448230] [2025-03-08 22:46:23,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:23,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:46:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:23,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:46:23,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:46:23,649 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 19 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 22:46:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:23,755 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2025-03-08 22:46:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:46:23,756 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 19 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) Word has length 33 [2025-03-08 22:46:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:23,756 INFO L225 Difference]: With dead ends: 62 [2025-03-08 22:46:23,756 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 22:46:23,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:46:23,757 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:23,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 52 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 22:46:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2025-03-08 22:46:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 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 22:46:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2025-03-08 22:46:23,758 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 33 [2025-03-08 22:46:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:23,758 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2025-03-08 22:46:23,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 19 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 22:46:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2025-03-08 22:46:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:46:23,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:23,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:23,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:23,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 22:46:23,959 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:23,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash -882158622, now seen corresponding path program 2 times [2025-03-08 22:46:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:23,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209935489] [2025-03-08 22:46:23,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:23,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 22:46:23,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:46:23,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:23,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:46:24,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209935489] [2025-03-08 22:46:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209935489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856203623] [2025-03-08 22:46:24,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:24,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:24,268 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 22:46:24,269 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 22:46:24,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 22:46:24,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:46:24,325 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:24,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:24,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 22:46:24,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:24,373 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 11 treesize of output 7 [2025-03-08 22:46:24,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:46:24,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:24,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 22:46:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:46:24,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:24,840 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-03-08 22:46:24,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 92 [2025-03-08 22:46:24,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:24,849 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 92 treesize of output 92 [2025-03-08 22:46:24,859 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 6 treesize of output 4 [2025-03-08 22:46:24,886 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-08 22:46:24,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 120 [2025-03-08 22:46:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:46:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856203623] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:25,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:25,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2025-03-08 22:46:25,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275082785] [2025-03-08 22:46:25,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:25,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 22:46:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:25,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 22:46:25,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:46:25,038 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 36 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 36 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 22:46:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:25,332 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2025-03-08 22:46:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:46:25,333 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 36 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 36 [2025-03-08 22:46:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:25,333 INFO L225 Difference]: With dead ends: 63 [2025-03-08 22:46:25,333 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 22:46:25,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=1651, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 22:46:25,334 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 74 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:25,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 125 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 22:46:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 22:46:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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 22:46:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-03-08 22:46:25,335 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2025-03-08 22:46:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:25,335 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-03-08 22:46:25,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 36 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 22:46:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-03-08 22:46:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 22:46:25,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:25,336 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:25,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 22:46:25,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:25,536 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:46:25,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:25,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1149144223, now seen corresponding path program 3 times [2025-03-08 22:46:25,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:25,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621155666] [2025-03-08 22:46:25,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:25,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:25,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-08 22:46:25,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 38 statements. [2025-03-08 22:46:25,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:46:25,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 22:46:25,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:25,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621155666] [2025-03-08 22:46:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621155666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:25,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318288370] [2025-03-08 22:46:25,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:25,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:25,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:25,811 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 22:46:25,812 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 22:46:25,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-08 22:46:25,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 38 statements. [2025-03-08 22:46:25,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:46:25,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:25,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:46:25,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:25,899 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 11 treesize of output 7 [2025-03-08 22:46:25,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:46:26,046 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-08 22:46:26,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2025-03-08 22:46:26,194 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-08 22:46:26,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 23 [2025-03-08 22:46:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 22:46:26,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:26,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:26,522 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-08 22:46:26,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:26,528 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 44 treesize of output 40 [2025-03-08 22:46:26,535 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:46:26,536 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 9 treesize of output 5 [2025-03-08 22:46:26,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:26,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2025-03-08 22:46:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 22:46:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318288370] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:26,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-03-08 22:46:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875330879] [2025-03-08 22:46:26,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 22:46:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:26,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 22:46:26,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 22:46:26,572 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 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 22:46:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:26,735 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-03-08 22:46:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:46:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 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 38 [2025-03-08 22:46:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:26,736 INFO L225 Difference]: With dead ends: 34 [2025-03-08 22:46:26,736 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:46:26,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=1191, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 22:46:26,736 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:26,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:46:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:46:26,737 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 22:46:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:46:26,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2025-03-08 22:46:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:26,737 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:46:26,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 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 22:46:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:46:26,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (21 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (20 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (19 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (18 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (17 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (16 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (15 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (14 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (13 of 23 remaining) [2025-03-08 22:46:26,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (12 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (11 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (10 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-03-08 22:46:26,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2025-03-08 22:46:26,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 22:46:26,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:26,943 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:26,944 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:46:26,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:46:26 BoogieIcfgContainer [2025-03-08 22:46:26,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:46:26,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:46:26,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:46:26,946 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:46:26,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:08" (3/4) ... [2025-03-08 22:46:26,948 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:46:26,955 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 22:46:26,955 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:46:26,955 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:46:26,955 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:46:27,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:46:27,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:46:27,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:46:27,007 INFO L158 Benchmark]: Toolchain (without parser) took 18650.92ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 112.4MB in the beginning and 438.4MB in the end (delta: -326.0MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2025-03-08 22:46:27,008 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:46:27,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.40ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 95.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:46:27,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.96ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:46:27,008 INFO L158 Benchmark]: Boogie Preprocessor took 24.67ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:46:27,008 INFO L158 Benchmark]: IcfgBuilder took 286.33ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 76.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:46:27,008 INFO L158 Benchmark]: TraceAbstraction took 17984.28ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 75.7MB in the beginning and 446.1MB in the end (delta: -370.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-03-08 22:46:27,008 INFO L158 Benchmark]: Witness Printer took 60.63ms. Allocated memory is still 520.1MB. Free memory was 446.1MB in the beginning and 438.4MB in the end (delta: 7.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:46:27,009 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.16ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.40ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 95.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.96ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.67ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 286.33ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 76.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17984.28ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 75.7MB in the beginning and 446.1MB in the end (delta: -370.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Witness Printer took 60.63ms. Allocated memory is still 520.1MB. Free memory was 446.1MB in the beginning and 438.4MB in the end (delta: 7.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 534]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 545]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 545]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 545]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 545]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 545]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 547]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 547]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 547]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 547]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 547]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 547]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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, 56 locations, 60 edges, 23 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 31, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1991 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1991 mSDsluCounter, 3604 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2573 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4520 IncrementalHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 1031 mSDtfsCounter, 4520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1014 GetRequests, 592 SyntacticMatches, 9 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2383 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=15, InterpolantAutomatonStates: 247, 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, 31 MinimizatonAttempts, 467 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 975 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1280 ConstructedInterpolants, 46 QuantifiedInterpolants, 14253 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1899 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 63 InterpolantComputations, 17 PerfectInterpolantSequences, 516/731 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 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:46:27,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE