./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0283c4a072a13e5b82b0728b718582152e385c6ee1404b3ed9be4e37b84a0b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:46:44,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:46:44,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:46:44,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:46:44,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:46:44,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:46:44,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:46:44,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:46:44,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:46:44,437 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:46:44,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:46:44,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:46:44,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:46:44,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:46:44,437 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:46:44,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:46:44,437 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:46:44,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:46:44,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:46:44,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:46:44,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:46:44,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:46:44,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:46:44,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:46:44,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:46:44,439 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 -> e0283c4a072a13e5b82b0728b718582152e385c6ee1404b3ed9be4e37b84a0b2 [2025-03-17 11:46:44,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:46:44,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:46:44,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:46:44,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:46:44,684 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:46:44,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2025-03-17 11:46:45,877 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ecd3d17d/1ce075aff67a401c8dcf77684c39f12f/FLAGe3bc71ab0 [2025-03-17 11:46:46,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:46:46,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2025-03-17 11:46:46,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ecd3d17d/1ce075aff67a401c8dcf77684c39f12f/FLAGe3bc71ab0 [2025-03-17 11:46:46,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ecd3d17d/1ce075aff67a401c8dcf77684c39f12f [2025-03-17 11:46:46,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:46:46,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:46:46,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:46:46,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:46:46,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:46:46,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eea893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46, skipping insertion in model container [2025-03-17 11:46:46,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:46:46,398 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:46:46,398 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:46:46,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:46:46,421 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:46:46,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:46:46,470 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:46:46,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46 WrapperNode [2025-03-17 11:46:46,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:46:46,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:46:46,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:46:46,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:46:46,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,499 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 104 [2025-03-17 11:46:46,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:46:46,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:46:46,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:46:46,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:46:46,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,521 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-03-17 11:46:46,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:46:46,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:46:46,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:46:46,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:46:46,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (1/1) ... [2025-03-17 11:46:46,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:46:46,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:46,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:46:46,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:46:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:46:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:46:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:46:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:46:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:46:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:46:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:46:46,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:46:46,649 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:46:46,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:46:46,808 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L550: havoc main_#t~nondet19#1;havoc main_#t~ret20#1;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; [2025-03-17 11:46:46,826 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-17 11:46:46,826 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:46:46,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:46:46,836 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:46:46,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:46:46 BoogieIcfgContainer [2025-03-17 11:46:46,836 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:46:46,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:46:46,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:46:46,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:46:46,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:46:46" (1/3) ... [2025-03-17 11:46:46,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7726e25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:46:46, skipping insertion in model container [2025-03-17 11:46:46,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:46:46" (2/3) ... [2025-03-17 11:46:46,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7726e25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:46:46, skipping insertion in model container [2025-03-17 11:46:46,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:46:46" (3/3) ... [2025-03-17 11:46:46,845 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca-2.i [2025-03-17 11:46:46,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:46:46,859 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrncmp-alloca-2.i that has 1 procedures, 49 locations, 1 initial locations, 3 loop locations, and 19 error locations. [2025-03-17 11:46:46,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:46:46,897 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;@6002d53b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:46:46,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-17 11:46:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 48 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-17 11:46:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:46:46,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:46,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:46:46,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:46,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1516093636, now seen corresponding path program 1 times [2025-03-17 11:46:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:46,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772095473] [2025-03-17 11:46:46,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:46,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:46:46,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:46:46,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:46,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772095473] [2025-03-17 11:46:47,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772095473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:47,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:47,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:46:47,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340769266] [2025-03-17 11:46:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:47,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:46:47,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:47,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:46:47,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:47,118 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 48 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:47,143 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-03-17 11:46:47,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:46:47,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:46:47,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:47,149 INFO L225 Difference]: With dead ends: 59 [2025-03-17 11:46:47,149 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 11:46:47,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:47,152 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:47,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 108 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 11:46:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2025-03-17 11:46:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-03-17 11:46:47,172 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 6 [2025-03-17 11:46:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:47,173 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-17 11:46:47,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-03-17 11:46:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:46:47,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:47,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:46:47,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:46:47,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:47,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1515170115, now seen corresponding path program 1 times [2025-03-17 11:46:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341383858] [2025-03-17 11:46:47,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:47,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:46:47,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:46:47,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:47,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:47,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:47,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341383858] [2025-03-17 11:46:47,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341383858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:47,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:47,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:46:47,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685446831] [2025-03-17 11:46:47,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:47,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:46:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:47,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:46:47,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:47,414 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:47,473 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-03-17 11:46:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:46:47,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:46:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:47,474 INFO L225 Difference]: With dead ends: 64 [2025-03-17 11:46:47,474 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 11:46:47,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:47,475 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:47,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 96 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 11:46:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2025-03-17 11:46:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 47 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-17 11:46:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-17 11:46:47,482 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 6 [2025-03-17 11:46:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:47,482 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-17 11:46:47,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-17 11:46:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:46:47,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:47,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:46:47,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:46:47,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:47,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1515170114, now seen corresponding path program 1 times [2025-03-17 11:46:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:47,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510951187] [2025-03-17 11:46:47,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:47,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:46:47,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:46:47,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:47,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510951187] [2025-03-17 11:46:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510951187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:47,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:47,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:46:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861045098] [2025-03-17 11:46:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:47,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:46:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:47,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:46:47,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:47,620 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:47,682 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-03-17 11:46:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:46:47,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:46:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:47,685 INFO L225 Difference]: With dead ends: 51 [2025-03-17 11:46:47,685 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 11:46:47,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:46:47,685 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:47,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 128 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 11:46:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-17 11:46:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 49 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-17 11:46:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-17 11:46:47,688 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 6 [2025-03-17 11:46:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:47,688 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-17 11:46:47,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-17 11:46:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:46:47,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:47,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:47,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:46:47,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:47,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:47,691 INFO L85 PathProgramCache]: Analyzing trace with hash 245732661, now seen corresponding path program 1 times [2025-03-17 11:46:47,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:47,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563583361] [2025-03-17 11:46:47,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:47,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:47,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:46:47,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:46:47,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:47,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:47,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:47,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563583361] [2025-03-17 11:46:47,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563583361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:47,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:47,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:46:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175927489] [2025-03-17 11:46:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:47,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:46:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:47,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:46:47,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:47,723 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:47,742 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-03-17 11:46:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:46:47,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:46:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:47,743 INFO L225 Difference]: With dead ends: 64 [2025-03-17 11:46:47,743 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 11:46:47,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:47,744 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:47,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 11:46:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2025-03-17 11:46:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-03-17 11:46:47,747 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 7 [2025-03-17 11:46:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:47,747 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-03-17 11:46:47,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-03-17 11:46:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:46:47,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:47,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:47,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:46:47,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:47,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash 245732502, now seen corresponding path program 1 times [2025-03-17 11:46:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:47,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900655477] [2025-03-17 11:46:47,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:47,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:46:47,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:46:47,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:47,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:47,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:47,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900655477] [2025-03-17 11:46:47,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900655477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:47,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:47,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:46:47,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788786271] [2025-03-17 11:46:47,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:47,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:46:47,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:47,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:46:47,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:47,876 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:47,925 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2025-03-17 11:46:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:46:47,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:46:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:47,927 INFO L225 Difference]: With dead ends: 66 [2025-03-17 11:46:47,927 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 11:46:47,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:47,928 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:47,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 11:46:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-03-17 11:46:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 63 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-17 11:46:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-03-17 11:46:47,936 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 7 [2025-03-17 11:46:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:47,936 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-03-17 11:46:47,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-03-17 11:46:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:46:47,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:47,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:47,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:46:47,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:47,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash 246656182, now seen corresponding path program 1 times [2025-03-17 11:46:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:47,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850443205] [2025-03-17 11:46:47,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:47,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:46:47,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:46:47,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:47,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:47,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:47,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850443205] [2025-03-17 11:46:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850443205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:47,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:47,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:46:47,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337293593] [2025-03-17 11:46:47,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:47,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:46:47,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:47,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:46:47,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:46:47,980 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:48,005 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-03-17 11:46:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:46:48,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:46:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:48,006 INFO L225 Difference]: With dead ends: 62 [2025-03-17 11:46:48,006 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 11:46:48,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:46:48,008 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:48,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 64 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 11:46:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 11:46:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2025-03-17 11:46:48,013 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 7 [2025-03-17 11:46:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:48,014 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2025-03-17 11:46:48,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2025-03-17 11:46:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:46:48,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:48,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:48,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:46:48,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:48,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:48,016 INFO L85 PathProgramCache]: Analyzing trace with hash 246656183, now seen corresponding path program 1 times [2025-03-17 11:46:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:48,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786358373] [2025-03-17 11:46:48,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:48,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:48,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:46:48,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:46:48,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:48,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:48,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:48,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786358373] [2025-03-17 11:46:48,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786358373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:48,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:48,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:46:48,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280690240] [2025-03-17 11:46:48,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:48,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:46:48,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:48,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:46:48,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:46:48,162 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:48,229 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2025-03-17 11:46:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:46:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:46:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:48,230 INFO L225 Difference]: With dead ends: 68 [2025-03-17 11:46:48,230 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 11:46:48,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-17 11:46:48,231 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 31 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:48,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 95 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 11:46:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-03-17 11:46:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.607843137254902) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-03-17 11:46:48,237 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 7 [2025-03-17 11:46:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:48,237 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-17 11:46:48,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2025-03-17 11:46:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:46:48,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:48,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:48,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:46:48,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:48,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash 274361653, now seen corresponding path program 1 times [2025-03-17 11:46:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:48,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000921248] [2025-03-17 11:46:48,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:48,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:46:48,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:46:48,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:48,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:48,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000921248] [2025-03-17 11:46:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000921248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:48,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:46:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686494394] [2025-03-17 11:46:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:46:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:48,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:46:48,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:48,327 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:48,345 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2025-03-17 11:46:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:46:48,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:46:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:48,346 INFO L225 Difference]: With dead ends: 65 [2025-03-17 11:46:48,346 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 11:46:48,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:48,347 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:48,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 11:46:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2025-03-17 11:46:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 57 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2025-03-17 11:46:48,349 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 7 [2025-03-17 11:46:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:48,349 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2025-03-17 11:46:48,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2025-03-17 11:46:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:46:48,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:48,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:48,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:46:48,353 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:48,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash -972227049, now seen corresponding path program 1 times [2025-03-17 11:46:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:48,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10118429] [2025-03-17 11:46:48,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:48,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:46:48,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:46:48,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:48,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:48,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10118429] [2025-03-17 11:46:48,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10118429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:48,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:48,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:46:48,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515851465] [2025-03-17 11:46:48,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:48,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:46:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:48,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:46:48,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:48,434 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:48,453 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-03-17 11:46:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:46:48,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-17 11:46:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:48,454 INFO L225 Difference]: With dead ends: 61 [2025-03-17 11:46:48,454 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 11:46:48,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:48,454 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:48,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 11:46:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-17 11:46:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 59 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2025-03-17 11:46:48,461 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 8 [2025-03-17 11:46:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:48,461 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2025-03-17 11:46:48,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2025-03-17 11:46:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:46:48,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:48,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:48,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:46:48,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:48,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash -943597898, now seen corresponding path program 1 times [2025-03-17 11:46:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:48,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786635478] [2025-03-17 11:46:48,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:48,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:48,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:46:48,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:46:48,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:48,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:48,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:48,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786635478] [2025-03-17 11:46:48,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786635478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:48,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:48,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:46:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839109674] [2025-03-17 11:46:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:48,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:46:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:48,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:46:48,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:46:48,613 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:48,658 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2025-03-17 11:46:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:46:48,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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-17 11:46:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:48,659 INFO L225 Difference]: With dead ends: 63 [2025-03-17 11:46:48,659 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 11:46:48,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:46:48,660 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:48,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 11:46:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2025-03-17 11:46:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 59 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2025-03-17 11:46:48,666 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 8 [2025-03-17 11:46:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:48,666 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2025-03-17 11:46:48,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2025-03-17 11:46:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:46:48,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:48,666 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:48,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:46:48,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1673408953, now seen corresponding path program 1 times [2025-03-17 11:46:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932140194] [2025-03-17 11:46:48,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:48,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:48,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:46:48,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:46:48,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:48,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932140194] [2025-03-17 11:46:48,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932140194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:48,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944719620] [2025-03-17 11:46:48,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:48,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:48,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:48,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:46:48,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:46:48,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:46:48,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:48,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:48,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 11:46:48,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:48,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:46:48,976 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 7 [2025-03-17 11:46:48,985 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-17 11:46:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:49,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:49,268 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:46:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944719620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:49,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:49,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 11:46:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693593078] [2025-03-17 11:46:49,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:49,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:46:49,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:49,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:46:49,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:46:49,282 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:49,453 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2025-03-17 11:46:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:46:49,454 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 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 9 [2025-03-17 11:46:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:49,454 INFO L225 Difference]: With dead ends: 63 [2025-03-17 11:46:49,454 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 11:46:49,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:46:49,455 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:49,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 221 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 11:46:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2025-03-17 11:46:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-03-17 11:46:49,458 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 9 [2025-03-17 11:46:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:49,458 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-03-17 11:46:49,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-03-17 11:46:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:46:49,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:49,458 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:49,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:46:49,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 11:46:49,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:49,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash -554707494, now seen corresponding path program 1 times [2025-03-17 11:46:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2814990] [2025-03-17 11:46:49,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:49,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:49,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:46:49,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:46:49,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:49,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2814990] [2025-03-17 11:46:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2814990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874191593] [2025-03-17 11:46:49,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:49,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:49,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:49,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:49,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:46:49,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:46:49,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:46:49,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:49,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:49,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 11:46:49,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:49,886 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 7 [2025-03-17 11:46:49,892 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 8 treesize of output 1 [2025-03-17 11:46:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:50,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:50,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874191593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:50,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:50,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 11:46:50,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004865933] [2025-03-17 11:46:50,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:50,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 11:46:50,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:50,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 11:46:50,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:46:50,164 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:50,356 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-17 11:46:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:46:50,356 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:46:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:50,357 INFO L225 Difference]: With dead ends: 56 [2025-03-17 11:46:50,357 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 11:46:50,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:46:50,357 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 13 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:50,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 246 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 11:46:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2025-03-17 11:46:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-17 11:46:50,359 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 10 [2025-03-17 11:46:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:50,360 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-17 11:46:50,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-17 11:46:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:46:50,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:50,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:50,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:50,564 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,SelfDestructingSolverStorable11 [2025-03-17 11:46:50,564 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1643407566, now seen corresponding path program 1 times [2025-03-17 11:46:50,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:50,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020024859] [2025-03-17 11:46:50,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:50,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:46:50,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:46:50,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:50,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:50,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:50,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020024859] [2025-03-17 11:46:50,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020024859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:50,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:50,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:46:50,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277671531] [2025-03-17 11:46:50,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:50,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:46:50,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:50,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:46:50,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:50,609 INFO L87 Difference]: Start difference. First operand 53 states and 63 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-17 11:46:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:50,638 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2025-03-17 11:46:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:46:50,638 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 11 [2025-03-17 11:46:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:50,639 INFO L225 Difference]: With dead ends: 52 [2025-03-17 11:46:50,639 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 11:46:50,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:50,640 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:50,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 62 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 11:46:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-17 11:46:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 50 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-17 11:46:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-17 11:46:50,643 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 11 [2025-03-17 11:46:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:50,643 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-17 11:46:50,643 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-17 11:46:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-17 11:46:50,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:46:50,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:50,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:50,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:46:50,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:50,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1643407567, now seen corresponding path program 1 times [2025-03-17 11:46:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:50,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533984322] [2025-03-17 11:46:50,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:50,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:46:50,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:46:50,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:50,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:50,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533984322] [2025-03-17 11:46:50,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533984322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:50,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:50,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:46:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560322705] [2025-03-17 11:46:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:50,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:46:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:50,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:46:50,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:46:50,724 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:50,783 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2025-03-17 11:46:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:46:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 11:46:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:50,784 INFO L225 Difference]: With dead ends: 70 [2025-03-17 11:46:50,784 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 11:46:50,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:46:50,785 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:50,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 129 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 11:46:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2025-03-17 11:46:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.5) internal successors, (69), 55 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-17 11:46:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2025-03-17 11:46:50,787 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 11 [2025-03-17 11:46:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:50,787 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2025-03-17 11:46:50,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2025-03-17 11:46:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:46:50,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:50,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:50,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:46:50,790 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:50,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:50,791 INFO L85 PathProgramCache]: Analyzing trace with hash -16068109, now seen corresponding path program 1 times [2025-03-17 11:46:50,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:50,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726377688] [2025-03-17 11:46:50,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:50,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:50,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:46:50,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:46:50,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:50,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726377688] [2025-03-17 11:46:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726377688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815497735] [2025-03-17 11:46:50,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:50,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:50,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:50,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:50,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:46:51,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:46:51,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:46:51,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:51,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:51,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 11:46:51,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:51,062 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 7 [2025-03-17 11:46:51,066 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 8 treesize of output 1 [2025-03-17 11:46:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:51,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815497735] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:46:51,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 16 [2025-03-17 11:46:51,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207601064] [2025-03-17 11:46:51,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:51,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:46:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:51,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:46:51,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:46:51,276 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:51,403 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2025-03-17 11:46:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:46:51,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 11:46:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:51,403 INFO L225 Difference]: With dead ends: 56 [2025-03-17 11:46:51,404 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 11:46:51,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:46:51,404 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:51,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 124 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 11:46:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2025-03-17 11:46:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 51 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-17 11:46:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2025-03-17 11:46:51,406 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 11 [2025-03-17 11:46:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:51,406 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2025-03-17 11:46:51,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2025-03-17 11:46:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:46:51,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:51,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:51,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:51,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:51,607 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:51,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash -593974896, now seen corresponding path program 1 times [2025-03-17 11:46:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509689121] [2025-03-17 11:46:51,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:51,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:46:51,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:46:51,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:51,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:51,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:51,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509689121] [2025-03-17 11:46:51,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509689121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:51,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:51,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:46:51,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403833643] [2025-03-17 11:46:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:51,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:46:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:51,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:46:51,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:51,675 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:51,694 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-03-17 11:46:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:46:51,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:46:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:51,694 INFO L225 Difference]: With dead ends: 51 [2025-03-17 11:46:51,694 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 11:46:51,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:51,695 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:51,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 57 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 11:46:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 11:46:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.435897435897436) internal successors, (56), 46 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-17 11:46:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2025-03-17 11:46:51,696 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 12 [2025-03-17 11:46:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:51,696 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-03-17 11:46:51,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2025-03-17 11:46:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:46:51,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:51,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:46:51,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1233293941, now seen corresponding path program 1 times [2025-03-17 11:46:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013887822] [2025-03-17 11:46:51,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:51,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:46:51,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:46:51,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:51,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:51,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:51,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013887822] [2025-03-17 11:46:51,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013887822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:51,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:51,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:46:51,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020263277] [2025-03-17 11:46:51,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:51,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:46:51,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:51,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:46:51,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:51,729 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:51,760 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-03-17 11:46:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:46:51,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-03-17 11:46:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:51,761 INFO L225 Difference]: With dead ends: 46 [2025-03-17 11:46:51,761 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 11:46:51,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:46:51,761 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:51,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 63 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 11:46:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 11:46:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 45 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-17 11:46:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-03-17 11:46:51,763 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 13 [2025-03-17 11:46:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:51,763 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-03-17 11:46:51,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-03-17 11:46:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:46:51,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:51,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:51,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:46:51,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:51,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1233293940, now seen corresponding path program 1 times [2025-03-17 11:46:51,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:51,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511784394] [2025-03-17 11:46:51,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:51,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:51,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:46:51,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:46:51,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:51,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:51,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511784394] [2025-03-17 11:46:51,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511784394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:51,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:51,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:46:51,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828296663] [2025-03-17 11:46:51,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:51,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:46:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:51,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:46:51,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:46:51,836 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:51,892 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-03-17 11:46:51,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:46:51,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-03-17 11:46:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:51,893 INFO L225 Difference]: With dead ends: 50 [2025-03-17 11:46:51,893 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 11:46:51,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:46:51,893 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:51,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 105 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 11:46:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-03-17 11:46:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.358974358974359) internal successors, (53), 45 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-17 11:46:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-03-17 11:46:51,895 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 13 [2025-03-17 11:46:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:51,895 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-17 11:46:51,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-03-17 11:46:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:46:51,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:51,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:51,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:46:51,896 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash 215496316, now seen corresponding path program 1 times [2025-03-17 11:46:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-03-17 11:46:51,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:51,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:46:51,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:46:51,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:51,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:51,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:51,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-03-17 11:46:51,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56326566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:46:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299741317] [2025-03-17 11:46:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:46:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:51,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:46:51,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:46:51,924 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:51,949 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-03-17 11:46:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:46:51,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:46:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:51,950 INFO L225 Difference]: With dead ends: 45 [2025-03-17 11:46:51,950 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 11:46:51,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:51,950 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:51,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 57 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 11:46:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 11:46:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 44 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-17 11:46:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-03-17 11:46:51,952 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 15 [2025-03-17 11:46:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:51,952 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-03-17 11:46:51,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-03-17 11:46:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:46:51,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:51,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:51,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:46:51,953 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:51,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash 215496317, now seen corresponding path program 1 times [2025-03-17 11:46:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:51,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110211159] [2025-03-17 11:46:51,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:51,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:51,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:46:51,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:46:51,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:51,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110211159] [2025-03-17 11:46:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110211159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:46:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878537084] [2025-03-17 11:46:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:52,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:46:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:52,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:46:52,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:46:52,074 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:52,130 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2025-03-17 11:46:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:46:52,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:46:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:52,131 INFO L225 Difference]: With dead ends: 55 [2025-03-17 11:46:52,131 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 11:46:52,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:46:52,132 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:52,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 89 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 11:46:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2025-03-17 11:46:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 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-17 11:46:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-03-17 11:46:52,133 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 15 [2025-03-17 11:46:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:52,133 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-17 11:46:52,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-03-17 11:46:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:46:52,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:52,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:52,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:46:52,134 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:52,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash 933479237, now seen corresponding path program 1 times [2025-03-17 11:46:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:52,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139595065] [2025-03-17 11:46:52,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:52,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:52,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:46:52,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:46:52,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:52,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139595065] [2025-03-17 11:46:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139595065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:46:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498502872] [2025-03-17 11:46:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:52,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:46:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:52,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:46:52,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:52,182 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-17 11:46:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:52,205 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-03-17 11:46:52,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:46:52,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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 17 [2025-03-17 11:46:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:52,205 INFO L225 Difference]: With dead ends: 45 [2025-03-17 11:46:52,205 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 11:46:52,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:46:52,206 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:52,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 11:46:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 11:46:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 44 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-17 11:46:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-03-17 11:46:52,207 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 17 [2025-03-17 11:46:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:52,207 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-03-17 11:46:52,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-17 11:46:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-03-17 11:46:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:46:52,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:52,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:52,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:46:52,208 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:52,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash 933479238, now seen corresponding path program 1 times [2025-03-17 11:46:52,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:52,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-17 11:46:52,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:52,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:46:52,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:46:52,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:52,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:52,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-17 11:46:52,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890172531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:52,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:52,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:46:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875062965] [2025-03-17 11:46:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:52,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:46:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:52,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:46:52,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:46:52,373 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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-17 11:46:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:52,449 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2025-03-17 11:46:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:46:52,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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 17 [2025-03-17 11:46:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:52,452 INFO L225 Difference]: With dead ends: 56 [2025-03-17 11:46:52,452 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 11:46:52,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:46:52,453 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:52,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 11:46:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2025-03-17 11:46:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 43 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-17 11:46:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-03-17 11:46:52,455 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 17 [2025-03-17 11:46:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:52,455 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-03-17 11:46:52,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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-17 11:46:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-03-17 11:46:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:46:52,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:52,455 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-17 11:46:52,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:46:52,455 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:52,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1125375571, now seen corresponding path program 1 times [2025-03-17 11:46:52,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:52,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495193140] [2025-03-17 11:46:52,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:52,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:52,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:46:52,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:46:52,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:52,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495193140] [2025-03-17 11:46:52,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495193140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:52,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:52,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:46:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708344666] [2025-03-17 11:46:52,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:52,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:46:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:52,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:46:52,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:46:52,591 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:52,631 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2025-03-17 11:46:52,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:46:52,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-17 11:46:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:52,632 INFO L225 Difference]: With dead ends: 58 [2025-03-17 11:46:52,632 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 11:46:52,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:46:52,633 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:52,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 161 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 11:46:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 11:46:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 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-17 11:46:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-03-17 11:46:52,634 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2025-03-17 11:46:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:52,634 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-03-17 11:46:52,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-03-17 11:46:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:46:52,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:52,635 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-17 11:46:52,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:46:52,635 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash 227934126, now seen corresponding path program 1 times [2025-03-17 11:46:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:52,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017334680] [2025-03-17 11:46:52,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:52,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:46:52,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:46:52,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:52,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017334680] [2025-03-17 11:46:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017334680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:52,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:52,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:46:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700621824] [2025-03-17 11:46:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:52,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:46:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:52,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:46:52,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:46:52,779 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:52,825 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-03-17 11:46:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:46:52,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-17 11:46:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:52,826 INFO L225 Difference]: With dead ends: 59 [2025-03-17 11:46:52,826 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 11:46:52,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:46:52,826 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:52,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 155 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:46:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 11:46:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-17 11:46:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-17 11:46:52,827 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2025-03-17 11:46:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-17 11:46:52,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-17 11:46:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:46:52,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:52,828 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-17 11:46:52,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:46:52,828 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:52,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1910228439, now seen corresponding path program 1 times [2025-03-17 11:46:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:52,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612439999] [2025-03-17 11:46:52,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:52,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:46:52,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:46:52,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:52,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:52,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:52,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612439999] [2025-03-17 11:46:52,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612439999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:52,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715870707] [2025-03-17 11:46:52,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:52,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:52,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:52,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:52,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:46:52,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:46:53,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:46:53,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:53,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:53,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 11:46:53,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:53,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:53,187 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 5 treesize of output 3 [2025-03-17 11:46:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:53,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715870707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:53,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:53,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-17 11:46:53,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394531130] [2025-03-17 11:46:53,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:53,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:46:53,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:53,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:46:53,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:46:53,204 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:53,333 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-17 11:46:53,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:46:53,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:46:53,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:53,334 INFO L225 Difference]: With dead ends: 52 [2025-03-17 11:46:53,334 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 11:46:53,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:46:53,335 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:53,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 168 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 11:46:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2025-03-17 11:46:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-17 11:46:53,336 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2025-03-17 11:46:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:53,336 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-17 11:46:53,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-17 11:46:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:46:53,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:53,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:53,344 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-17 11:46:53,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:53,541 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:53,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1778495386, now seen corresponding path program 1 times [2025-03-17 11:46:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948104780] [2025-03-17 11:46:53,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:53,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:46:53,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:46:53,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:53,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:53,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:53,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948104780] [2025-03-17 11:46:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948104780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:53,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:46:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328730285] [2025-03-17 11:46:53,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:53,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:46:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:53,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:46:53,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:46:53,701 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:53,755 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-03-17 11:46:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:46:53,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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-17 11:46:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:53,756 INFO L225 Difference]: With dead ends: 53 [2025-03-17 11:46:53,756 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 11:46:53,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:46:53,756 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:53,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 11:46:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 11:46:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-03-17 11:46:53,758 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 23 [2025-03-17 11:46:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:53,758 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-03-17 11:46:53,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:53,758 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-03-17 11:46:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:46:53,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:53,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:53,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:46:53,759 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:53,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1567144473, now seen corresponding path program 1 times [2025-03-17 11:46:53,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:53,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626846737] [2025-03-17 11:46:53,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:53,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:46:53,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:46:53,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:53,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:53,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626846737] [2025-03-17 11:46:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626846737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:46:53,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:46:53,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:46:53,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205541638] [2025-03-17 11:46:53,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:46:53,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:46:53,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:53,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:46:53,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:46:53,946 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:54,010 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2025-03-17 11:46:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:46:54,010 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 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-17 11:46:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:54,010 INFO L225 Difference]: With dead ends: 50 [2025-03-17 11:46:54,010 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 11:46:54,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:46:54,011 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:54,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 141 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 11:46:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-17 11:46:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 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-17 11:46:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-03-17 11:46:54,012 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 23 [2025-03-17 11:46:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:54,013 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-03-17 11:46:54,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-03-17 11:46:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:46:54,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:54,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:54,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:46:54,014 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:54,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1208631512, now seen corresponding path program 1 times [2025-03-17 11:46:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:54,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484234762] [2025-03-17 11:46:54,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:54,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:46:54,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:46:54,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:54,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:54,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:54,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484234762] [2025-03-17 11:46:54,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484234762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:54,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318103789] [2025-03-17 11:46:54,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:54,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:54,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:54,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:54,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:46:54,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:46:54,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:46:54,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:54,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:54,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 11:46:54,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:54,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:54,428 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 5 treesize of output 3 [2025-03-17 11:46:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:54,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318103789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:54,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:54,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-03-17 11:46:54,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936550621] [2025-03-17 11:46:54,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:54,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:46:54,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:54,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:46:54,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:46:54,449 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 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-17 11:46:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:54,592 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-03-17 11:46:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:46:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 11:46:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:54,592 INFO L225 Difference]: With dead ends: 42 [2025-03-17 11:46:54,592 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 11:46:54,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:46:54,593 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:54,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 11:46:54,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-17 11:46:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-03-17 11:46:54,594 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 26 [2025-03-17 11:46:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:54,595 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-03-17 11:46:54,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 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-17 11:46:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-03-17 11:46:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 11:46:54,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:54,595 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-17 11:46:54,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:54,799 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,SelfDestructingSolverStorable27 [2025-03-17 11:46:54,799 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:54,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1853714151, now seen corresponding path program 1 times [2025-03-17 11:46:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907139781] [2025-03-17 11:46:54,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:54,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:46:54,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:46:54,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:54,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:46:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907139781] [2025-03-17 11:46:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907139781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286551785] [2025-03-17 11:46:54,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:54,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:54,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:46:54,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:46:54,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:46:54,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:54,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:54,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-17 11:46:54,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:54,969 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-17 11:46:54,970 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 19 [2025-03-17 11:46:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:55,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:55,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286551785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:55,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:55,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 13] total 33 [2025-03-17 11:46:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971461019] [2025-03-17 11:46:55,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:55,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 11:46:55,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:55,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 11:46:55,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:46:55,887 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 34 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:56,673 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2025-03-17 11:46:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 11:46:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 11:46:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:56,678 INFO L225 Difference]: With dead ends: 94 [2025-03-17 11:46:56,678 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 11:46:56,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=3003, Unknown=0, NotChecked=0, Total=3422 [2025-03-17 11:46:56,680 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:56,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 140 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:46:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 11:46:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 39. [2025-03-17 11:46:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.1388888888888888) 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-17 11:46:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-03-17 11:46:56,682 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 28 [2025-03-17 11:46:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:56,682 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-03-17 11:46:56,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-03-17 11:46:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 11:46:56,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:56,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:56,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 11:46:56,883 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,SelfDestructingSolverStorable28 [2025-03-17 11:46:56,883 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:56,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 992077538, now seen corresponding path program 1 times [2025-03-17 11:46:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-03-17 11:46:56,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:56,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:46:56,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:46:56,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:56,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-03-17 11:46:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798448606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791371268] [2025-03-17 11:46:57,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:57,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:57,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:57,103 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:57,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:46:57,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:46:57,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:46:57,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:57,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:57,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:46:57,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:57,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:57,403 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 5 treesize of output 3 [2025-03-17 11:46:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:57,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791371268] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:57,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:57,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2025-03-17 11:46:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675293951] [2025-03-17 11:46:57,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:57,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:46:57,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:57,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:46:57,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:46:57,422 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-17 11:46:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:57,534 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2025-03-17 11:46:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:46:57,534 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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 30 [2025-03-17 11:46:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:57,534 INFO L225 Difference]: With dead ends: 51 [2025-03-17 11:46:57,534 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 11:46:57,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:46:57,535 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:57,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 142 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 11:46:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2025-03-17 11:46:57,536 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-17 11:46:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-03-17 11:46:57,536 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 30 [2025-03-17 11:46:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:57,536 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-03-17 11:46:57,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-17 11:46:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-03-17 11:46:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 11:46:57,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:57,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:57,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:57,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:57,737 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:57,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash 691171729, now seen corresponding path program 1 times [2025-03-17 11:46:57,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:57,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73425634] [2025-03-17 11:46:57,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:57,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:57,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:46:57,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:46:57,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:57,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:57,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73425634] [2025-03-17 11:46:57,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73425634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544977398] [2025-03-17 11:46:57,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:46:57,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:57,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:57,961 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:57,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:46:58,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:46:58,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:46:58,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:58,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:58,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:46:58,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:58,080 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 13 treesize of output 9 [2025-03-17 11:46:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:58,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:58,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:46:58,154 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 16 treesize of output 12 [2025-03-17 11:46:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544977398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:58,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2025-03-17 11:46:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609037441] [2025-03-17 11:46:58,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:58,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:46:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:58,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:46:58,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:46:58,202 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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-17 11:46:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:58,314 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-03-17 11:46:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:46:58,314 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 31 [2025-03-17 11:46:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:58,315 INFO L225 Difference]: With dead ends: 66 [2025-03-17 11:46:58,315 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 11:46:58,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:46:58,316 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:58,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 312 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 11:46:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-17 11:46:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-03-17 11:46:58,318 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 31 [2025-03-17 11:46:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:58,318 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-03-17 11:46:58,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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-17 11:46:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-03-17 11:46:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 11:46:58,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:58,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:58,326 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-17 11:46:58,519 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,SelfDestructingSolverStorable30 [2025-03-17 11:46:58,520 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:58,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1551715756, now seen corresponding path program 2 times [2025-03-17 11:46:58,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022784773] [2025-03-17 11:46:58,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:58,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 11:46:58,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:46:58,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:58,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:58,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022784773] [2025-03-17 11:46:58,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022784773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081161708] [2025-03-17 11:46:58,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:58,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:58,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:58,768 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:58,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 11:46:58,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 11:46:58,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:46:58,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:58,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:58,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 11:46:58,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:58,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:59,074 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 5 treesize of output 3 [2025-03-17 11:46:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:59,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081161708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:59,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:59,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-17 11:46:59,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353465962] [2025-03-17 11:46:59,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:59,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:46:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:59,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:46:59,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:46:59,111 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:59,245 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2025-03-17 11:46:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:46:59,246 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 11:46:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:59,246 INFO L225 Difference]: With dead ends: 52 [2025-03-17 11:46:59,246 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 11:46:59,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:46:59,247 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:59,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 151 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:46:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 11:46:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2025-03-17 11:46:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-03-17 11:46:59,249 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 34 [2025-03-17 11:46:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:59,249 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-03-17 11:46:59,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-03-17 11:46:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 11:46:59,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:59,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:59,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:59,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:59,450 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:59,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash -845190703, now seen corresponding path program 2 times [2025-03-17 11:46:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:59,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755177271] [2025-03-17 11:46:59,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:59,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:59,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 11:46:59,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:46:59,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:59,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:46:59,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:59,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755177271] [2025-03-17 11:46:59,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755177271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:59,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333888020] [2025-03-17 11:46:59,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:59,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:59,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:59,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:59,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 11:46:59,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 11:46:59,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:46:59,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:59,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:59,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 11:46:59,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:59,861 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 8 treesize of output 1 [2025-03-17 11:46:59,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:46:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:46:59,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:04,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-17 11:47:04,158 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 34 treesize of output 30 [2025-03-17 11:47:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:47:04,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333888020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:04,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:04,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 35 [2025-03-17 11:47:04,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038016934] [2025-03-17 11:47:04,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 11:47:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:04,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 11:47:04,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1067, Unknown=1, NotChecked=0, Total=1190 [2025-03-17 11:47:04,243 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:04,444 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2025-03-17 11:47:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:47:04,444 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 11:47:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:04,444 INFO L225 Difference]: With dead ends: 69 [2025-03-17 11:47:04,444 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 11:47:04,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=155, Invalid=1326, Unknown=1, NotChecked=0, Total=1482 [2025-03-17 11:47:04,445 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:04,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 347 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:47:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 11:47:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-03-17 11:47:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 49 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-17 11:47:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-03-17 11:47:04,447 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 36 [2025-03-17 11:47:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:04,447 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-03-17 11:47:04,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2025-03-17 11:47:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 11:47:04,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:04,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:04,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 11:47:04,647 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,SelfDestructingSolverStorable32 [2025-03-17 11:47:04,648 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:04,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -10376468, now seen corresponding path program 3 times [2025-03-17 11:47:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:04,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485307148] [2025-03-17 11:47:04,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:04,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:04,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-03-17 11:47:04,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:47:04,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:47:04,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:47:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485307148] [2025-03-17 11:47:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485307148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448558567] [2025-03-17 11:47:04,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:04,922 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:04,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 11:47:04,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-03-17 11:47:05,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:47:05,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:47:05,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:05,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:47:05,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:47:05,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:05,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-17 11:47:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:47:05,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448558567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:05,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:05,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2025-03-17 11:47:05,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161774395] [2025-03-17 11:47:05,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:05,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:47:05,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:05,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:47:05,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:47:05,279 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:05,456 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2025-03-17 11:47:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:47:05,460 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 11:47:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:05,460 INFO L225 Difference]: With dead ends: 52 [2025-03-17 11:47:05,460 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 11:47:05,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:47:05,460 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:05,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:47:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 11:47:05,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 11:47:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 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-17 11:47:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-03-17 11:47:05,462 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 39 [2025-03-17 11:47:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-03-17 11:47:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-03-17 11:47:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 11:47:05,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:05,462 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:05,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 11:47:05,662 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,SelfDestructingSolverStorable33 [2025-03-17 11:47:05,663 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:05,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:05,663 INFO L85 PathProgramCache]: Analyzing trace with hash -815116122, now seen corresponding path program 2 times [2025-03-17 11:47:05,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:05,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98674607] [2025-03-17 11:47:05,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:47:05,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:05,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 11:47:05,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 43 statements. [2025-03-17 11:47:05,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:47:05,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:47:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:05,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98674607] [2025-03-17 11:47:05,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98674607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:47:05,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:47:05,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:47:05,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804558966] [2025-03-17 11:47:05,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:47:05,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:47:05,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:05,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:47:05,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:47:05,714 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:05,745 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2025-03-17 11:47:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:47:05,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 11:47:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:05,746 INFO L225 Difference]: With dead ends: 51 [2025-03-17 11:47:05,746 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 11:47:05,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:47:05,746 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:05,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 65 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:47:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 11:47:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 11:47:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 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-17 11:47:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-03-17 11:47:05,748 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 43 [2025-03-17 11:47:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:05,748 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-03-17 11:47:05,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-03-17 11:47:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 11:47:05,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:05,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:05,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:47:05,748 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:05,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:05,749 INFO L85 PathProgramCache]: Analyzing trace with hash 502743117, now seen corresponding path program 3 times [2025-03-17 11:47:05,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:05,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830344374] [2025-03-17 11:47:05,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:05,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:05,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-17 11:47:05,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:47:05,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 11:47:05,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:07,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:07,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830344374] [2025-03-17 11:47:07,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830344374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:07,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184514898] [2025-03-17 11:47:07,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:07,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:07,131 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:07,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 11:47:07,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-17 11:47:07,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:47:07,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 11:47:07,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:07,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-17 11:47:07,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:07,378 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 13 treesize of output 9 [2025-03-17 11:47:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:47:07,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:07,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-17 11:47:07,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:47:07,850 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 16 treesize of output 12 [2025-03-17 11:47:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:47:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184514898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:07,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:07,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 16] total 48 [2025-03-17 11:47:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530771609] [2025-03-17 11:47:07,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:07,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 11:47:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:07,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 11:47:07,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2117, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 11:47:07,999 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:09,358 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2025-03-17 11:47:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 11:47:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-17 11:47:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:09,359 INFO L225 Difference]: With dead ends: 102 [2025-03-17 11:47:09,359 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 11:47:09,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=282, Invalid=4008, Unknown=0, NotChecked=0, Total=4290 [2025-03-17 11:47:09,360 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:09,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 312 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:47:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 11:47:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2025-03-17 11:47:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 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-17 11:47:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-03-17 11:47:09,362 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 44 [2025-03-17 11:47:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:09,362 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-03-17 11:47:09,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-03-17 11:47:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 11:47:09,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:09,363 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:09,377 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-17 11:47:09,563 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,SelfDestructingSolverStorable35 [2025-03-17 11:47:09,563 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:09,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1897936488, now seen corresponding path program 4 times [2025-03-17 11:47:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:09,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131379455] [2025-03-17 11:47:09,564 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:09,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:09,572 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-17 11:47:09,589 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:47:09,589 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:09,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:09,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:09,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131379455] [2025-03-17 11:47:09,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131379455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:09,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531162461] [2025-03-17 11:47:09,955 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:09,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:09,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:09,959 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-17 11:47:09,960 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-17 11:47:10,021 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-17 11:47:10,063 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:47:10,064 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:10,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:10,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-17 11:47:10,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:10,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:47:10,222 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-17 11:47:10,253 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 13 treesize of output 9 [2025-03-17 11:47:10,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:47:10,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:47:10,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-03-17 11:47:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:10,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:10,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2025-03-17 11:47:10,880 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 62 treesize of output 54 [2025-03-17 11:47:10,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 11:47:10,920 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 77 treesize of output 69 [2025-03-17 11:47:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:47:11,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531162461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:11,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:11,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 21] total 48 [2025-03-17 11:47:11,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826684702] [2025-03-17 11:47:11,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:11,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 11:47:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:11,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 11:47:11,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2054, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 11:47:11,058 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:11,400 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2025-03-17 11:47:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 11:47:11,400 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 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 47 [2025-03-17 11:47:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:11,400 INFO L225 Difference]: With dead ends: 92 [2025-03-17 11:47:11,400 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 11:47:11,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=2144, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 11:47:11,401 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:11,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 245 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:47:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 11:47:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-17 11:47:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 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-17 11:47:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2025-03-17 11:47:11,402 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2025-03-17 11:47:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:11,402 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2025-03-17 11:47:11,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2025-03-17 11:47:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:47:11,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:11,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:11,409 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-17 11:47:11,603 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,SelfDestructingSolverStorable36 [2025-03-17 11:47:11,603 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:11,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash 877957419, now seen corresponding path program 5 times [2025-03-17 11:47:11,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:11,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278957140] [2025-03-17 11:47:11,604 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:47:11,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:11,613 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-03-17 11:47:11,625 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:47:11,625 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 11:47:11,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278957140] [2025-03-17 11:47:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278957140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682327284] [2025-03-17 11:47:11,793 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:47:11,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:11,795 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-17 11:47:11,796 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-17 11:47:11,859 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-03-17 11:47:11,890 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:47:11,891 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 11:47:11,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:11,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 11:47:11,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:12,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:12,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 11:47:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682327284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:12,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:12,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-03-17 11:47:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191923152] [2025-03-17 11:47:12,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 11:47:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:12,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 11:47:12,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:47:12,310 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 27 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 27 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:12,535 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-03-17 11:47:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:47:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 27 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-17 11:47:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:12,536 INFO L225 Difference]: With dead ends: 63 [2025-03-17 11:47:12,536 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 11:47:12,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:47:12,538 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:12,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 274 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:47:12,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 11:47:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-03-17 11:47:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 58 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-17 11:47:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2025-03-17 11:47:12,540 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 50 [2025-03-17 11:47:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:12,540 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2025-03-17 11:47:12,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 27 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2025-03-17 11:47:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 11:47:12,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:12,541 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:12,547 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-17 11:47:12,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:12,745 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:12,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1903488744, now seen corresponding path program 4 times [2025-03-17 11:47:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:12,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-17 11:47:12,745 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:12,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-17 11:47:12,767 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:47:12,768 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:12,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:12,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-17 11:47:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410511436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:12,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523127072] [2025-03-17 11:47:12,941 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:12,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:12,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:12,943 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-17 11:47:12,945 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-17 11:47:13,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-17 11:47:13,046 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:47:13,047 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:13,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:13,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 11:47:13,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:13,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:47:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:13,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523127072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:13,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:13,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2025-03-17 11:47:13,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867313969] [2025-03-17 11:47:13,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:13,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:47:13,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:13,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:47:13,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:47:13,513 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 32 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 32 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:13,726 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2025-03-17 11:47:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:47:13,726 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 32 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-17 11:47:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:13,726 INFO L225 Difference]: With dead ends: 61 [2025-03-17 11:47:13,726 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 11:47:13,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=1101, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 11:47:13,727 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:13,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:47:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 11:47:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 11:47:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 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-17 11:47:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2025-03-17 11:47:13,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 52 [2025-03-17 11:47:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:13,728 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2025-03-17 11:47:13,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 32 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2025-03-17 11:47:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:47:13,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:13,728 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:13,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 11:47:13,929 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,SelfDestructingSolverStorable38 [2025-03-17 11:47:13,929 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:13,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash 41621969, now seen corresponding path program 6 times [2025-03-17 11:47:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3152087] [2025-03-17 11:47:13,929 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:47:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:13,936 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 57 statements into 5 equivalence classes. [2025-03-17 11:47:13,952 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:47:13,952 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 11:47:13,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:14,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3152087] [2025-03-17 11:47:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3152087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180553387] [2025-03-17 11:47:14,282 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:47:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:14,283 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-17 11:47:14,284 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-17 11:47:14,343 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 57 statements into 5 equivalence classes. [2025-03-17 11:47:14,388 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:47:14,389 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 11:47:14,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:14,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-17 11:47:14,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:14,451 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-17 11:47:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:14,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:14,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:47:14,632 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 16 treesize of output 12 [2025-03-17 11:47:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:14,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180553387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:14,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:14,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 33 [2025-03-17 11:47:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685323952] [2025-03-17 11:47:14,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:14,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 11:47:14,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:14,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 11:47:14,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 11:47:14,727 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 33 states, 33 states have (on average 3.212121212121212) internal successors, (106), 33 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:14,933 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2025-03-17 11:47:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:47:14,933 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.212121212121212) internal successors, (106), 33 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-17 11:47:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:14,934 INFO L225 Difference]: With dead ends: 107 [2025-03-17 11:47:14,934 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 11:47:14,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 11:47:14,934 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:14,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 474 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:47:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 11:47:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-03-17 11:47:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 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-17 11:47:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2025-03-17 11:47:14,935 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2025-03-17 11:47:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:14,936 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2025-03-17 11:47:14,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.212121212121212) internal successors, (106), 33 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2025-03-17 11:47:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 11:47:14,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:14,936 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:14,945 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-17 11:47:15,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-17 11:47:15,136 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 633019604, now seen corresponding path program 7 times [2025-03-17 11:47:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142924669] [2025-03-17 11:47:15,137 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:47:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:15,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 11:47:15,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 11:47:15,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:47:15,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 5 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142924669] [2025-03-17 11:47:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142924669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458959211] [2025-03-17 11:47:15,386 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:47:15,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:15,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:15,388 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-17 11:47:15,389 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-17 11:47:15,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 11:47:15,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 11:47:15,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:47:15,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:15,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 11:47:15,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:15,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:15,787 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 5 treesize of output 3 [2025-03-17 11:47:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:47:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458959211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:15,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:15,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2025-03-17 11:47:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218398966] [2025-03-17 11:47:15,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:15,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 11:47:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:15,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 11:47:15,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:47:15,842 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 29 states, 28 states have (on average 4.071428571428571) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:16,021 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2025-03-17 11:47:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:47:16,022 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.071428571428571) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 60 [2025-03-17 11:47:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:16,022 INFO L225 Difference]: With dead ends: 73 [2025-03-17 11:47:16,022 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 11:47:16,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:47:16,023 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:16,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 261 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:47:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 11:47:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2025-03-17 11:47:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2025-03-17 11:47:16,024 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 60 [2025-03-17 11:47:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:16,024 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2025-03-17 11:47:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.071428571428571) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2025-03-17 11:47:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 11:47:16,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:16,024 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:16,031 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-17 11:47:16,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:16,225 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:16,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1553517487, now seen corresponding path program 5 times [2025-03-17 11:47:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:16,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-03-17 11:47:16,225 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:47:16,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:16,232 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 62 statements into 5 equivalence classes. [2025-03-17 11:47:16,250 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:47:16,250 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 11:47:16,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:16,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-03-17 11:47:16,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800942936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:16,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114052772] [2025-03-17 11:47:16,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:47:16,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:16,762 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:16,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 11:47:16,833 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 62 statements into 5 equivalence classes. [2025-03-17 11:47:16,869 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:47:16,869 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 11:47:16,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:16,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-17 11:47:16,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:16,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:47:17,138 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 19 treesize of output 1 [2025-03-17 11:47:17,157 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 13 treesize of output 9 [2025-03-17 11:47:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:17,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:17,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-17 11:47:17,869 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 34 treesize of output 30 [2025-03-17 11:47:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114052772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:18,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:18,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28, 22] total 68 [2025-03-17 11:47:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608132721] [2025-03-17 11:47:18,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:18,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-17 11:47:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:18,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-17 11:47:18,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=4322, Unknown=0, NotChecked=0, Total=4556 [2025-03-17 11:47:18,259 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 68 states, 68 states have (on average 2.2205882352941178) internal successors, (151), 68 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:19,332 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2025-03-17 11:47:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 11:47:19,332 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.2205882352941178) internal successors, (151), 68 states have internal predecessors, (151), 0 states have call successors, (0), 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 62 [2025-03-17 11:47:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:19,333 INFO L225 Difference]: With dead ends: 107 [2025-03-17 11:47:19,333 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 11:47:19,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=422, Invalid=8134, Unknown=0, NotChecked=0, Total=8556 [2025-03-17 11:47:19,335 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:19,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 399 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:47:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 11:47:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-03-17 11:47:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 71 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2025-03-17 11:47:19,340 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 62 [2025-03-17 11:47:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:19,340 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2025-03-17 11:47:19,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.2205882352941178) internal successors, (151), 68 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2025-03-17 11:47:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 11:47:19,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:19,341 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:19,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-17 11:47:19,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:19,541 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:19,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash 369569836, now seen corresponding path program 6 times [2025-03-17 11:47:19,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:19,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964799670] [2025-03-17 11:47:19,542 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:47:19,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:19,549 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 65 statements into 5 equivalence classes. [2025-03-17 11:47:19,563 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 11:47:19,563 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 11:47:19,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:19,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:19,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964799670] [2025-03-17 11:47:19,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964799670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:19,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398210509] [2025-03-17 11:47:19,842 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:47:19,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:19,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:19,844 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:19,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 11:47:19,922 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 65 statements into 5 equivalence classes. [2025-03-17 11:47:19,986 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 11:47:19,986 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 11:47:19,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:19,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 11:47:19,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:19,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:47:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 12 proven. 64 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:20,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 12 proven. 64 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:20,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398210509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:20,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:20,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2025-03-17 11:47:20,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999409822] [2025-03-17 11:47:20,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:20,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 11:47:20,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:20,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 11:47:20,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 11:47:20,383 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 38 states, 37 states have (on average 3.5675675675675675) internal successors, (132), 38 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:20,640 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2025-03-17 11:47:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 11:47:20,640 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.5675675675675675) internal successors, (132), 38 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 11:47:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:20,641 INFO L225 Difference]: With dead ends: 74 [2025-03-17 11:47:20,641 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 11:47:20,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1792, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 11:47:20,642 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:20,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 187 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:47:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 11:47:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 11:47:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 73 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2025-03-17 11:47:20,644 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 65 [2025-03-17 11:47:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:20,644 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-03-17 11:47:20,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.5675675675675675) internal successors, (132), 38 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2025-03-17 11:47:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 11:47:20,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:20,644 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:20,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 11:47:20,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:20,845 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:20,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -936180979, now seen corresponding path program 8 times [2025-03-17 11:47:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:20,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502235414] [2025-03-17 11:47:20,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:47:20,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:20,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-17 11:47:20,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 11:47:20,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:47:20,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 5 proven. 92 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:21,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:21,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502235414] [2025-03-17 11:47:21,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502235414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:21,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655165528] [2025-03-17 11:47:21,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:47:21,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:21,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:21,387 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:21,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 11:47:21,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-17 11:47:21,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 11:47:21,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:47:21,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:21,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-17 11:47:21,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:21,608 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 13 treesize of output 9 [2025-03-17 11:47:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 9 proven. 88 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:21,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:21,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-17 11:47:21,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:47:21,953 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 16 treesize of output 12 [2025-03-17 11:47:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 9 proven. 88 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655165528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:22,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:22,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 40 [2025-03-17 11:47:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668804657] [2025-03-17 11:47:22,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:22,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 11:47:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:22,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 11:47:22,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1463, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 11:47:22,015 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 40 states, 40 states have (on average 3.175) internal successors, (127), 40 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:23,082 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2025-03-17 11:47:23,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 11:47:23,083 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.175) internal successors, (127), 40 states have internal predecessors, (127), 0 states have call successors, (0), 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 70 [2025-03-17 11:47:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:23,083 INFO L225 Difference]: With dead ends: 126 [2025-03-17 11:47:23,083 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 11:47:23,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=237, Invalid=4185, Unknown=0, NotChecked=0, Total=4422 [2025-03-17 11:47:23,084 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:23,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 398 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:47:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 11:47:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2025-03-17 11:47:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.05) internal successors, (84), 81 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2025-03-17 11:47:23,086 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 70 [2025-03-17 11:47:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:23,086 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2025-03-17 11:47:23,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.175) internal successors, (127), 40 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2025-03-17 11:47:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 11:47:23,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:23,086 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:23,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-17 11:47:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-03-17 11:47:23,287 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 440768101, now seen corresponding path program 7 times [2025-03-17 11:47:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755847612] [2025-03-17 11:47:23,287 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:47:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:23,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 11:47:23,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 11:47:23,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:47:23,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 12 proven. 108 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:23,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755847612] [2025-03-17 11:47:23,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755847612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475946025] [2025-03-17 11:47:23,646 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:47:23,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:23,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:23,648 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:23,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 11:47:23,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 11:47:23,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 11:47:23,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:47:23,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:23,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 11:47:23,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 22 proven. 98 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:23,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:24,191 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 5 treesize of output 3 [2025-03-17 11:47:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 22 proven. 98 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:47:24,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475946025] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:24,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 35 [2025-03-17 11:47:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542010189] [2025-03-17 11:47:24,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 11:47:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:24,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 11:47:24,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 11:47:24,257 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 36 states, 35 states have (on average 3.857142857142857) internal successors, (135), 36 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:24,630 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2025-03-17 11:47:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:47:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.857142857142857) internal successors, (135), 36 states have internal predecessors, (135), 0 states have call successors, (0), 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 75 [2025-03-17 11:47:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:24,630 INFO L225 Difference]: With dead ends: 84 [2025-03-17 11:47:24,630 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 11:47:24,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 125 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=1525, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 11:47:24,631 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:24,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 490 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:47:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 11:47:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-17 11:47:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.048780487804878) internal successors, (86), 83 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-17 11:47:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2025-03-17 11:47:24,632 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 75 [2025-03-17 11:47:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:24,632 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2025-03-17 11:47:24,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.857142857142857) internal successors, (135), 36 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2025-03-17 11:47:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 11:47:24,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:24,633 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:24,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-17 11:47:24,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-03-17 11:47:24,834 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:24,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:24,835 INFO L85 PathProgramCache]: Analyzing trace with hash 709400692, now seen corresponding path program 9 times [2025-03-17 11:47:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092443571] [2025-03-17 11:47:24,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:24,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 7 equivalence classes. [2025-03-17 11:47:24,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:47:24,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 11:47:24,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 82 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 11:47:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092443571] [2025-03-17 11:47:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092443571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584820545] [2025-03-17 11:47:25,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:25,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:25,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:25,390 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:25,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 11:47:25,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 7 equivalence classes. [2025-03-17 11:47:25,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:47:25,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 11:47:25,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:25,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-17 11:47:25,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:25,703 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-17 11:47:25,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 11:47:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 43 proven. 88 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 11:47:25,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:25,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-17 11:47:26,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:47:26,107 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 16 treesize of output 12 [2025-03-17 11:47:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 43 proven. 88 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 11:47:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584820545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:26,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:26,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2025-03-17 11:47:26,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190529954] [2025-03-17 11:47:26,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:26,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-17 11:47:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:26,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-17 11:47:26,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2295, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 11:47:26,270 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 50 states, 50 states have (on average 3.68) internal successors, (184), 50 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:26,977 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2025-03-17 11:47:26,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:47:26,978 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.68) internal successors, (184), 50 states have internal predecessors, (184), 0 states have call successors, (0), 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 80 [2025-03-17 11:47:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:26,978 INFO L225 Difference]: With dead ends: 143 [2025-03-17 11:47:26,978 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 11:47:26,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=309, Invalid=4521, Unknown=0, NotChecked=0, Total=4830 [2025-03-17 11:47:26,979 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:26,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 592 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:47:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 11:47:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-17 11:47:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 86 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-17 11:47:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2025-03-17 11:47:26,980 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 80 [2025-03-17 11:47:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:26,980 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2025-03-17 11:47:26,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.68) internal successors, (184), 50 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2025-03-17 11:47:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 11:47:26,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:26,981 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:26,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-17 11:47:27,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:27,181 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:27,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:27,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1471799825, now seen corresponding path program 10 times [2025-03-17 11:47:27,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:27,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130008569] [2025-03-17 11:47:27,182 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:27,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:27,191 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-03-17 11:47:27,208 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 11:47:27,208 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:27,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 11:47:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130008569] [2025-03-17 11:47:27,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130008569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515585098] [2025-03-17 11:47:27,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:27,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:27,641 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:27,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 11:47:27,724 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-03-17 11:47:27,828 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 11:47:27,828 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:27,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-17 11:47:27,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:27,984 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-17 11:47:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 11 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:28,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:28,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:47:28,229 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 16 treesize of output 12 [2025-03-17 11:47:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 11:47:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515585098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:28,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 19] total 41 [2025-03-17 11:47:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793859987] [2025-03-17 11:47:28,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:28,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 11:47:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:28,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 11:47:28,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1512, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 11:47:28,376 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 41 states, 41 states have (on average 3.8048780487804876) internal successors, (156), 41 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:28,815 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2025-03-17 11:47:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 11:47:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.8048780487804876) internal successors, (156), 41 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-17 11:47:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:28,816 INFO L225 Difference]: With dead ends: 155 [2025-03-17 11:47:28,816 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 11:47:28,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 11:47:28,816 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:28,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 705 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:47:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 11:47:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-03-17 11:47:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 89 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-17 11:47:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2025-03-17 11:47:28,818 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 83 [2025-03-17 11:47:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:28,818 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2025-03-17 11:47:28,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.8048780487804876) internal successors, (156), 41 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2025-03-17 11:47:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 11:47:28,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:28,818 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:28,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-17 11:47:29,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:29,019 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:29,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1977657516, now seen corresponding path program 11 times [2025-03-17 11:47:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801729890] [2025-03-17 11:47:29,019 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:47:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:29,028 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 7 equivalence classes. [2025-03-17 11:47:29,058 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:47:29,058 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 11:47:29,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 35 proven. 127 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 11:47:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801729890] [2025-03-17 11:47:29,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801729890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911194705] [2025-03-17 11:47:29,442 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:47:29,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:29,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:29,444 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:29,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 11:47:29,537 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 7 equivalence classes. [2025-03-17 11:47:29,631 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:47:29,631 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 11:47:29,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:29,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-17 11:47:29,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 35 proven. 127 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 11:47:29,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:30,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 11:47:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 35 proven. 127 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 11:47:30,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911194705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:30,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 42 [2025-03-17 11:47:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101368661] [2025-03-17 11:47:30,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 11:47:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:30,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 11:47:30,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1573, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 11:47:30,425 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 43 states, 42 states have (on average 4.285714285714286) internal successors, (180), 43 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:30,744 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2025-03-17 11:47:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:47:30,745 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 4.285714285714286) internal successors, (180), 43 states have internal predecessors, (180), 0 states have call successors, (0), 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 86 [2025-03-17 11:47:30,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:30,745 INFO L225 Difference]: With dead ends: 99 [2025-03-17 11:47:30,745 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 11:47:30,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1714, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 11:47:30,747 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:30,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 401 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:47:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 11:47:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-03-17 11:47:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.043010752688172) internal successors, (97), 94 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2025-03-17 11:47:30,749 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 86 [2025-03-17 11:47:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:30,749 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2025-03-17 11:47:30,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 4.285714285714286) internal successors, (180), 43 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2025-03-17 11:47:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 11:47:30,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:30,750 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:30,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-17 11:47:30,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-17 11:47:30,951 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:30,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:30,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2141638353, now seen corresponding path program 8 times [2025-03-17 11:47:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:30,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936202662] [2025-03-17 11:47:30,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:47:30,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:30,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-17 11:47:30,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 11:47:30,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:47:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 23 proven. 135 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:47:31,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936202662] [2025-03-17 11:47:31,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936202662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196774975] [2025-03-17 11:47:31,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:47:31,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:31,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:31,417 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:31,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 11:47:31,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-17 11:47:31,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 11:47:31,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:47:31,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:31,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-03-17 11:47:31,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:31,641 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 19 treesize of output 1 [2025-03-17 11:47:31,901 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 21 treesize of output 1 [2025-03-17 11:47:31,919 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 13 treesize of output 9 [2025-03-17 11:47:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 23 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:32,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:32,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-17 11:47:32,492 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 34 treesize of output 30 [2025-03-17 11:47:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 23 proven. 135 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:47:32,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196774975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:32,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:32,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31, 28] total 67 [2025-03-17 11:47:32,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549091036] [2025-03-17 11:47:32,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:32,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-17 11:47:32,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:32,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-17 11:47:32,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=4209, Unknown=0, NotChecked=0, Total=4422 [2025-03-17 11:47:32,914 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 67 states, 67 states have (on average 2.6865671641791047) internal successors, (180), 67 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:34,305 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2025-03-17 11:47:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-17 11:47:34,306 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.6865671641791047) internal successors, (180), 67 states have internal predecessors, (180), 0 states have call successors, (0), 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 88 [2025-03-17 11:47:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:34,306 INFO L225 Difference]: With dead ends: 147 [2025-03-17 11:47:34,306 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 11:47:34,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=378, Invalid=7278, Unknown=0, NotChecked=0, Total=7656 [2025-03-17 11:47:34,326 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 2777 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:34,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1047 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2777 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 11:47:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 11:47:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-03-17 11:47:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2025-03-17 11:47:34,329 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 88 [2025-03-17 11:47:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:34,329 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-03-17 11:47:34,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.6865671641791047) internal successors, (180), 67 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2025-03-17 11:47:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 11:47:34,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:34,330 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:34,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-17 11:47:34,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-17 11:47:34,531 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:34,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash 874534252, now seen corresponding path program 9 times [2025-03-17 11:47:34,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:34,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095035096] [2025-03-17 11:47:34,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:34,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 7 equivalence classes. [2025-03-17 11:47:34,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 11:47:34,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 11:47:34,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 22 proven. 152 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:47:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095035096] [2025-03-17 11:47:35,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095035096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037053823] [2025-03-17 11:47:35,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:35,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:35,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:35,066 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:35,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-17 11:47:35,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 7 equivalence classes. [2025-03-17 11:47:35,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 11:47:35,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 11:47:35,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:35,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 11:47:35,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 35 proven. 139 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:47:35,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:35,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-17 11:47:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 35 proven. 139 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:47:35,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037053823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:35,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:35,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 41 [2025-03-17 11:47:35,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289210791] [2025-03-17 11:47:35,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:35,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 11:47:35,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:35,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 11:47:35,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 11:47:35,881 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand has 42 states, 41 states have (on average 3.8780487804878048) internal successors, (159), 42 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:36,218 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2025-03-17 11:47:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 11:47:36,219 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.8780487804878048) internal successors, (159), 42 states have internal predecessors, (159), 0 states have call successors, (0), 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 91 [2025-03-17 11:47:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:36,219 INFO L225 Difference]: With dead ends: 100 [2025-03-17 11:47:36,219 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 11:47:36,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=420, Invalid=2442, Unknown=0, NotChecked=0, Total=2862 [2025-03-17 11:47:36,220 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:36,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 172 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:47:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 11:47:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 11:47:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 99 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2025-03-17 11:47:36,221 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 91 [2025-03-17 11:47:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:36,221 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2025-03-17 11:47:36,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.8780487804878048) internal successors, (159), 42 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2025-03-17 11:47:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 11:47:36,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:36,222 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:36,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-17 11:47:36,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-17 11:47:36,422 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:36,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash 574563789, now seen corresponding path program 12 times [2025-03-17 11:47:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897087992] [2025-03-17 11:47:36,423 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:47:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:36,431 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 8 equivalence classes. [2025-03-17 11:47:36,459 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 11:47:36,459 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-17 11:47:36,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 13 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:38,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:38,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897087992] [2025-03-17 11:47:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897087992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:38,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861783287] [2025-03-17 11:47:38,305 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:47:38,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:38,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:38,307 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:38,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-17 11:47:38,401 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 8 equivalence classes. [2025-03-17 11:47:38,580 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 11:47:38,580 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-17 11:47:38,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:38,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 171 conjuncts are in the unsatisfiable core [2025-03-17 11:47:38,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:39,255 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-17 11:47:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 13 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:40,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:40,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-17 11:47:40,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:47:40,739 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 16 treesize of output 12 [2025-03-17 11:47:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 13 proven. 192 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:47:41,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861783287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:41,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:41,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38, 24] total 91 [2025-03-17 11:47:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484685806] [2025-03-17 11:47:41,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:41,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-17 11:47:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:41,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-17 11:47:41,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2025-03-17 11:47:41,139 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 91 states, 91 states have (on average 2.857142857142857) internal successors, (260), 91 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:44,069 INFO L93 Difference]: Finished difference Result 232 states and 236 transitions. [2025-03-17 11:47:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-17 11:47:44,069 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 2.857142857142857) internal successors, (260), 91 states have internal predecessors, (260), 0 states have call successors, (0), 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 96 [2025-03-17 11:47:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:44,070 INFO L225 Difference]: With dead ends: 232 [2025-03-17 11:47:44,070 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 11:47:44,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=501, Invalid=14261, Unknown=0, NotChecked=0, Total=14762 [2025-03-17 11:47:44,071 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 4739 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 4761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:44,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1164 Invalid, 4761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4739 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 11:47:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 11:47:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2025-03-17 11:47:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 101 states have (on average 1.0396039603960396) internal successors, (105), 102 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2025-03-17 11:47:44,072 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 96 [2025-03-17 11:47:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:44,072 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2025-03-17 11:47:44,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 2.857142857142857) internal successors, (260), 91 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2025-03-17 11:47:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 11:47:44,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:44,073 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:44,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-17 11:47:44,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:44,273 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:44,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:44,274 INFO L85 PathProgramCache]: Analyzing trace with hash -448667288, now seen corresponding path program 13 times [2025-03-17 11:47:44,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:44,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714815818] [2025-03-17 11:47:44,274 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:47:44,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:44,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 11:47:44,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 11:47:44,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:47:44,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 13 proven. 262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:45,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714815818] [2025-03-17 11:47:45,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714815818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651126452] [2025-03-17 11:47:45,048 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:47:45,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:45,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:45,049 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:45,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-17 11:47:45,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 11:47:45,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 11:47:45,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:47:45,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:45,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-17 11:47:45,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:45,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 13 treesize of output 9 [2025-03-17 11:47:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 13 proven. 192 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:45,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:45,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:47:45,506 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 16 treesize of output 12 [2025-03-17 11:47:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 13 proven. 192 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651126452] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:45,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:45,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21, 21] total 42 [2025-03-17 11:47:45,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481316374] [2025-03-17 11:47:45,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:45,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 11:47:45,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:45,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 11:47:45,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1587, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 11:47:45,590 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 42 states, 42 states have (on average 3.238095238095238) internal successors, (136), 42 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:46,133 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2025-03-17 11:47:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 11:47:46,133 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.238095238095238) internal successors, (136), 42 states have internal predecessors, (136), 0 states have call successors, (0), 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 99 [2025-03-17 11:47:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:46,134 INFO L225 Difference]: With dead ends: 184 [2025-03-17 11:47:46,134 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 11:47:46,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=2086, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 11:47:46,134 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:46,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 711 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:47:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 11:47:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2025-03-17 11:47:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2025-03-17 11:47:46,136 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 99 [2025-03-17 11:47:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:46,136 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2025-03-17 11:47:46,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.238095238095238) internal successors, (136), 42 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2025-03-17 11:47:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 11:47:46,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:46,136 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:46,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-17 11:47:46,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:46,337 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:46,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1821536427, now seen corresponding path program 14 times [2025-03-17 11:47:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:46,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971160798] [2025-03-17 11:47:46,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:47:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:46,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-17 11:47:46,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 11:47:46,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:47:46,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 35 proven. 189 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:46,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:46,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971160798] [2025-03-17 11:47:46,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971160798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:46,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661604749] [2025-03-17 11:47:46,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:47:46,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:46,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:46,816 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:46,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-17 11:47:46,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-17 11:47:46,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 11:47:46,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:47:46,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:46,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-17 11:47:46,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 51 proven. 173 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:47,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:47,362 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 5 treesize of output 3 [2025-03-17 11:47:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 51 proven. 173 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:47,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661604749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:47,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:47,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 31 [2025-03-17 11:47:47,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337229496] [2025-03-17 11:47:47,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:47,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:47:47,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:47,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:47:47,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:47:47,422 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand has 32 states, 31 states have (on average 4.645161290322581) internal successors, (144), 32 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:47,756 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2025-03-17 11:47:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:47:47,756 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.645161290322581) internal successors, (144), 32 states have internal predecessors, (144), 0 states have call successors, (0), 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 102 [2025-03-17 11:47:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:47,757 INFO L225 Difference]: With dead ends: 115 [2025-03-17 11:47:47,757 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 11:47:47,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 183 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 11:47:47,757 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:47,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 481 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:47:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 11:47:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2025-03-17 11:47:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.036697247706422) internal successors, (113), 110 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2025-03-17 11:47:47,759 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 102 [2025-03-17 11:47:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:47,759 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2025-03-17 11:47:47,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.645161290322581) internal successors, (144), 32 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2025-03-17 11:47:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 11:47:47,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:47,760 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:47,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-17 11:47:47,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:47,960 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:47,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1850151320, now seen corresponding path program 10 times [2025-03-17 11:47:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476730146] [2025-03-17 11:47:47,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:47,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-03-17 11:47:47,985 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 11:47:47,985 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:47,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 51 proven. 187 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:48,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476730146] [2025-03-17 11:47:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476730146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312527057] [2025-03-17 11:47:48,379 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:48,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:48,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:48,381 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:48,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-17 11:47:48,480 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-03-17 11:47:48,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 11:47:48,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:48,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:48,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-17 11:47:48,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:48,747 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-17 11:47:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 51 proven. 187 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:49,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 51 proven. 187 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:49,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312527057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:49,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:49,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 51 [2025-03-17 11:47:49,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027847702] [2025-03-17 11:47:49,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 11:47:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:49,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 11:47:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2345, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 11:47:49,678 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand has 52 states, 51 states have (on average 4.019607843137255) internal successors, (205), 52 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:50,238 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2025-03-17 11:47:50,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 11:47:50,239 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 4.019607843137255) internal successors, (205), 52 states have internal predecessors, (205), 0 states have call successors, (0), 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 104 [2025-03-17 11:47:50,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:50,239 INFO L225 Difference]: With dead ends: 113 [2025-03-17 11:47:50,239 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 11:47:50,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=393, Invalid=3147, Unknown=0, NotChecked=0, Total=3540 [2025-03-17 11:47:50,240 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:50,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 680 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:47:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 11:47:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 11:47:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 112 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2025-03-17 11:47:50,241 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 104 [2025-03-17 11:47:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:50,241 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2025-03-17 11:47:50,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.019607843137255) internal successors, (205), 52 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2025-03-17 11:47:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 11:47:50,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:50,242 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:50,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-17 11:47:50,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2025-03-17 11:47:50,446 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:50,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1840592303, now seen corresponding path program 15 times [2025-03-17 11:47:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:50,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801288319] [2025-03-17 11:47:50,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:50,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 9 equivalence classes. [2025-03-17 11:47:50,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 11:47:50,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 11:47:50,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 15 proven. 259 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:51,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801288319] [2025-03-17 11:47:51,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801288319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139190693] [2025-03-17 11:47:51,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:47:51,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:51,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:51,700 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:51,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-17 11:47:51,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 9 equivalence classes. [2025-03-17 11:47:52,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 11:47:52,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 11:47:52,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:52,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 184 conjuncts are in the unsatisfiable core [2025-03-17 11:47:52,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:52,749 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 13 treesize of output 9 [2025-03-17 11:47:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 15 proven. 329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:47:53,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:47:53,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-17 11:47:54,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:47:54,192 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 16 treesize of output 12 [2025-03-17 11:47:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 15 proven. 259 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:47:54,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139190693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:47:54,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:47:54,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41, 26] total 98 [2025-03-17 11:47:54,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309171632] [2025-03-17 11:47:54,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:47:54,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-03-17 11:47:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:47:54,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-03-17 11:47:54,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=9230, Unknown=0, NotChecked=0, Total=9506 [2025-03-17 11:47:54,650 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand has 98 states, 98 states have (on average 2.836734693877551) internal successors, (278), 98 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:47:58,410 INFO L93 Difference]: Finished difference Result 324 states and 329 transitions. [2025-03-17 11:47:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-17 11:47:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.836734693877551) internal successors, (278), 98 states have internal predecessors, (278), 0 states have call successors, (0), 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 109 [2025-03-17 11:47:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:47:58,411 INFO L225 Difference]: With dead ends: 324 [2025-03-17 11:47:58,411 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 11:47:58,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3687 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=701, Invalid=23791, Unknown=0, NotChecked=0, Total=24492 [2025-03-17 11:47:58,412 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 6140 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 6156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 6140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:47:58,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1324 Invalid, 6156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 6140 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 11:47:58,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 11:47:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-17 11:47:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.0341880341880343) internal successors, (121), 118 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2025-03-17 11:47:58,413 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 109 [2025-03-17 11:47:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:47:58,414 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2025-03-17 11:47:58,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.836734693877551) internal successors, (278), 98 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:47:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2025-03-17 11:47:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 11:47:58,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:47:58,414 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:47:58,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-17 11:47:58,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:58,619 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:47:58,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:47:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash -813113873, now seen corresponding path program 16 times [2025-03-17 11:47:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:47:58,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601785786] [2025-03-17 11:47:58,619 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:47:58,628 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-17 11:47:58,640 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 11:47:58,641 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:58,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 70 proven. 226 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 11:47:59,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:47:59,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601785786] [2025-03-17 11:47:59,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601785786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:47:59,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189890608] [2025-03-17 11:47:59,081 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:47:59,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:47:59,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:47:59,092 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:47:59,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-17 11:47:59,204 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-17 11:47:59,541 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 11:47:59,541 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:47:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:47:59,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-17 11:47:59,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:47:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 70 proven. 226 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 11:47:59,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:48:00,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 11:48:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 70 proven. 226 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 11:48:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189890608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:48:00,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:48:00,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 51 [2025-03-17 11:48:00,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924895764] [2025-03-17 11:48:00,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:48:00,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 11:48:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:00,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 11:48:00,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2306, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 11:48:00,453 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand has 52 states, 51 states have (on average 4.392156862745098) internal successors, (224), 52 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:00,861 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2025-03-17 11:48:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 11:48:00,861 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 4.392156862745098) internal successors, (224), 52 states have internal predecessors, (224), 0 states have call successors, (0), 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 115 [2025-03-17 11:48:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:00,861 INFO L225 Difference]: With dead ends: 128 [2025-03-17 11:48:00,861 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 11:48:00,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=387, Invalid=2475, Unknown=0, NotChecked=0, Total=2862 [2025-03-17 11:48:00,862 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:00,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 638 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:48:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 11:48:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-03-17 11:48:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 123 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2025-03-17 11:48:00,863 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 115 [2025-03-17 11:48:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:00,864 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2025-03-17 11:48:00,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.392156862745098) internal successors, (224), 52 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2025-03-17 11:48:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 11:48:00,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:00,864 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:48:00,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-17 11:48:01,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:48:01,068 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:48:01,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash 281615020, now seen corresponding path program 11 times [2025-03-17 11:48:01,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:01,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225663327] [2025-03-17 11:48:01,069 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:48:01,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:01,078 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 117 statements into 9 equivalence classes. [2025-03-17 11:48:01,104 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 11:48:01,104 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-17 11:48:01,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 70 proven. 242 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 11:48:01,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:01,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225663327] [2025-03-17 11:48:01,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225663327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:48:01,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757038634] [2025-03-17 11:48:01,563 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:48:01,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:48:01,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:48:01,565 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:48:01,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-17 11:48:01,674 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 117 statements into 9 equivalence classes. [2025-03-17 11:48:01,958 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 11:48:01,958 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-17 11:48:01,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:01,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-03-17 11:48:01,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:48:01,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:48:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 70 proven. 242 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 11:48:02,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:48:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 70 proven. 242 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 11:48:03,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757038634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:48:03,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:48:03,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 56 [2025-03-17 11:48:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405447502] [2025-03-17 11:48:03,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:48:03,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-17 11:48:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:03,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-17 11:48:03,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2825, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 11:48:03,065 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand has 57 states, 56 states have (on average 4.071428571428571) internal successors, (228), 57 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:03,695 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2025-03-17 11:48:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 11:48:03,695 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 4.071428571428571) internal successors, (228), 57 states have internal predecessors, (228), 0 states have call successors, (0), 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 117 [2025-03-17 11:48:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:03,696 INFO L225 Difference]: With dead ends: 126 [2025-03-17 11:48:03,696 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 11:48:03,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=468, Invalid=3822, Unknown=0, NotChecked=0, Total=4290 [2025-03-17 11:48:03,696 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:03,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 776 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:48:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 11:48:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-17 11:48:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.032258064516129) internal successors, (128), 125 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2025-03-17 11:48:03,697 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 117 [2025-03-17 11:48:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:03,698 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2025-03-17 11:48:03,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 4.071428571428571) internal successors, (228), 57 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2025-03-17 11:48:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 11:48:03,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:03,698 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:48:03,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-17 11:48:03,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-03-17 11:48:03,903 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:48:03,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2038454131, now seen corresponding path program 17 times [2025-03-17 11:48:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774967144] [2025-03-17 11:48:03,903 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:48:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:03,913 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 122 statements into 10 equivalence classes. [2025-03-17 11:48:03,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:48:03,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-17 11:48:03,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 17 proven. 336 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 11:48:04,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:04,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774967144] [2025-03-17 11:48:04,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774967144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:48:04,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034332800] [2025-03-17 11:48:04,550 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:48:04,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:48:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:48:04,551 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:48:04,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-17 11:48:04,664 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 122 statements into 10 equivalence classes. [2025-03-17 11:48:04,899 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:48:04,899 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-17 11:48:04,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:04,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-17 11:48:04,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:48:05,169 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-17 11:48:05,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 11:48:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 17 proven. 336 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 11:48:05,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:48:05,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-17 11:48:05,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 11:48:05,632 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 16 treesize of output 12 [2025-03-17 11:48:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 17 proven. 336 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 11:48:05,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034332800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:48:05,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:48:05,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 51 [2025-03-17 11:48:05,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963092902] [2025-03-17 11:48:05,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:48:05,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 11:48:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:05,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 11:48:05,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2409, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 11:48:05,723 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand has 51 states, 51 states have (on average 3.9607843137254903) internal successors, (202), 51 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:06,325 INFO L93 Difference]: Finished difference Result 222 states and 225 transitions. [2025-03-17 11:48:06,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 11:48:06,326 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.9607843137254903) internal successors, (202), 51 states have internal predecessors, (202), 0 states have call successors, (0), 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 122 [2025-03-17 11:48:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:06,326 INFO L225 Difference]: With dead ends: 222 [2025-03-17 11:48:06,326 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 11:48:06,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=3130, Unknown=0, NotChecked=0, Total=3306 [2025-03-17 11:48:06,327 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 2062 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:06,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1539 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:48:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 11:48:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2025-03-17 11:48:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 127 states have (on average 1.031496062992126) internal successors, (131), 128 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2025-03-17 11:48:06,328 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 122 [2025-03-17 11:48:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:06,328 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2025-03-17 11:48:06,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.9607843137254903) internal successors, (202), 51 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2025-03-17 11:48:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 11:48:06,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:06,329 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:48:06,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-03-17 11:48:06,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-03-17 11:48:06,529 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:48:06,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1738105366, now seen corresponding path program 18 times [2025-03-17 11:48:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:06,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935666600] [2025-03-17 11:48:06,530 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:48:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:06,540 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 125 statements into 10 equivalence classes. [2025-03-17 11:48:06,597 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:48:06,597 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-17 11:48:06,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 125 proven. 308 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 11:48:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935666600] [2025-03-17 11:48:07,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935666600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:48:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502214154] [2025-03-17 11:48:07,806 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:48:07,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:48:07,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:48:07,808 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:48:07,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-17 11:48:07,923 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 125 statements into 10 equivalence classes. [2025-03-17 11:48:08,391 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:48:08,391 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-17 11:48:08,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:08,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-17 11:48:08,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:48:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 92 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:09,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:48:09,806 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 15 treesize of output 11 [2025-03-17 11:48:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 92 proven. 308 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 11:48:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502214154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:48:10,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:48:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33, 25] total 87 [2025-03-17 11:48:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806078111] [2025-03-17 11:48:10,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:48:10,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-03-17 11:48:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:10,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-03-17 11:48:10,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=6978, Unknown=0, NotChecked=0, Total=7656 [2025-03-17 11:48:10,210 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand has 88 states, 87 states have (on average 3.896551724137931) internal successors, (339), 88 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:11,990 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2025-03-17 11:48:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 11:48:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 3.896551724137931) internal successors, (339), 88 states have internal predecessors, (339), 0 states have call successors, (0), 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 125 [2025-03-17 11:48:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:11,991 INFO L225 Difference]: With dead ends: 144 [2025-03-17 11:48:11,991 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 11:48:11,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5736 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1544, Invalid=14968, Unknown=0, NotChecked=0, Total=16512 [2025-03-17 11:48:11,992 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:11,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 182 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:48:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 11:48:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2025-03-17 11:48:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 133 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2025-03-17 11:48:11,993 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 125 [2025-03-17 11:48:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:11,993 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2025-03-17 11:48:11,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 87 states have (on average 3.896551724137931) internal successors, (339), 88 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2025-03-17 11:48:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 11:48:11,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:11,994 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:48:12,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-03-17 11:48:12,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-03-17 11:48:12,195 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:48:12,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 423020519, now seen corresponding path program 12 times [2025-03-17 11:48:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321788446] [2025-03-17 11:48:12,196 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:48:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:12,206 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 127 statements into 10 equivalence classes. [2025-03-17 11:48:12,262 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 11:48:12,263 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-17 11:48:12,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 51 proven. 320 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-17 11:48:14,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:14,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321788446] [2025-03-17 11:48:14,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321788446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:48:14,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384198540] [2025-03-17 11:48:14,127 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:48:14,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:48:14,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:48:14,129 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:48:14,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-17 11:48:14,248 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 127 statements into 10 equivalence classes.