./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcat-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/cstrcat-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 bfd8ca9d9dda86f57445168715d124831c95b647e7c1b1093bb129b0384cce9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:45:05,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:45:05,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:45:05,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:45:05,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:45:05,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:45:05,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:45:05,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:45:05,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:45:05,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:45:05,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:45:05,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:45:05,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:45:05,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:45:05,708 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:45:05,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:45:05,709 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:45:05,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:45:05,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:45:05,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:45:05,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:45:05,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:45:05,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:45:05,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:45:05,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:45:05,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:45:05,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:45:05,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:45:05,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:45:05,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:45:05,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:45:05,712 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 -> bfd8ca9d9dda86f57445168715d124831c95b647e7c1b1093bb129b0384cce9e [2025-03-17 11:45:05,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:45:05,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:45:05,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:45:05,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:45:05,953 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:45:05,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2025-03-17 11:45:07,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f4223a19/b7a6aa9e46cc444fa694c91722b723ba/FLAGbce37c923 [2025-03-17 11:45:07,414 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:45:07,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2025-03-17 11:45:07,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f4223a19/b7a6aa9e46cc444fa694c91722b723ba/FLAGbce37c923 [2025-03-17 11:45:07,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f4223a19/b7a6aa9e46cc444fa694c91722b723ba [2025-03-17 11:45:07,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:45:07,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:45:07,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:45:07,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:45:07,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:45:07,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:07,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6081d3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07, skipping insertion in model container [2025-03-17 11:45:07,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:07,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:45:07,898 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:45:07,899 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:45:07,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:45:07,909 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:45:07,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:45:07,970 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:45:07,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07 WrapperNode [2025-03-17 11:45:07,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:45:07,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:45:07,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:45:07,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:45:07,975 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:45:07" (1/1) ... [2025-03-17 11:45:07,984 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:45:07" (1/1) ... [2025-03-17 11:45:07,998 INFO L138 Inliner]: procedures = 117, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2025-03-17 11:45:07,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:45:08,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:45:08,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:45:08,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:45:08,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,021 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [2, 3]. [2025-03-17 11:45:08,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:45:08,030 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:45:08,030 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:45:08,031 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:45:08,031 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (1/1) ... [2025-03-17 11:45:08,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:45:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:08,056 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:45:08,058 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:45:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:45:08,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:45:08,159 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:45:08,161 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:45:08,354 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L537: call ULTIMATE.dealloc(main_#t~malloc10#1.base, main_#t~malloc10#1.offset);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call ULTIMATE.dealloc(main_#t~malloc11#1.base, main_#t~malloc11#1.offset);havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset; [2025-03-17 11:45:08,367 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-17 11:45:08,368 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:45:08,376 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:45:08,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:45:08,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:45:08 BoogieIcfgContainer [2025-03-17 11:45:08,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:45:08,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:45:08,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:45:08,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:45:08,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:45:07" (1/3) ... [2025-03-17 11:45:08,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ce1593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:45:08, skipping insertion in model container [2025-03-17 11:45:08,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:07" (2/3) ... [2025-03-17 11:45:08,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ce1593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:45:08, skipping insertion in model container [2025-03-17 11:45:08,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:45:08" (3/3) ... [2025-03-17 11:45:08,385 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca-2.i [2025-03-17 11:45:08,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:45:08,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcat-alloca-2.i that has 1 procedures, 39 locations, 1 initial locations, 4 loop locations, and 15 error locations. [2025-03-17 11:45:08,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:45:08,438 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;@19220299, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:45:08,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-17 11:45:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 38 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:45:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:45:08,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:08,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:45:08,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:08,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1841511789, now seen corresponding path program 1 times [2025-03-17 11:45:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:08,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162547119] [2025-03-17 11:45:08,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:08,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:08,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:08,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:08,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:08,572 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:45:08,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:08,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162547119] [2025-03-17 11:45:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162547119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:45:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235847455] [2025-03-17 11:45:08,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:08,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:08,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:08,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:08,596 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 38 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:08,640 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-03-17 11:45:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:08,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:08,647 INFO L225 Difference]: With dead ends: 40 [2025-03-17 11:45:08,647 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 11:45:08,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:45:08,651 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:08,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 11:45:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 11:45:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 36 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:45:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-17 11:45:08,678 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 6 [2025-03-17 11:45:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:08,678 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-17 11:45:08,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-17 11:45:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:45:08,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:08,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:08,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:45:08,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:08,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1252287410, now seen corresponding path program 1 times [2025-03-17 11:45:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050577702] [2025-03-17 11:45:08,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:08,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:08,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:45:08,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:45:08,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:08,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:08,791 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:45:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050577702] [2025-03-17 11:45:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050577702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957067868] [2025-03-17 11:45:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:08,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:08,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:08,795 INFO L87 Difference]: Start difference. First operand 37 states and 43 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:45:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:08,816 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2025-03-17 11:45:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:08,817 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:45:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:08,818 INFO L225 Difference]: With dead ends: 48 [2025-03-17 11:45:08,818 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 11:45:08,818 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:45:08,818 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:08,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 11:45:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2025-03-17 11:45:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 40 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:45:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-03-17 11:45:08,825 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 7 [2025-03-17 11:45:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:08,825 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-17 11:45:08,825 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:45:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-03-17 11:45:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:45:08,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:08,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:08,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:45:08,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:08,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1223658259, now seen corresponding path program 1 times [2025-03-17 11:45:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134453706] [2025-03-17 11:45:08,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:08,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:08,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:45:08,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:45:08,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:08,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:08,946 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:45:08,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:08,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134453706] [2025-03-17 11:45:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134453706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:08,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:45:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525077972] [2025-03-17 11:45:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:08,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:08,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:08,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:08,949 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 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:45:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:09,019 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-03-17 11:45:09,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:09,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 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:45:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:09,019 INFO L225 Difference]: With dead ends: 52 [2025-03-17 11:45:09,020 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 11:45:09,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:09,020 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:09,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 139 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 11:45:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2025-03-17 11:45:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 40 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:45:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-03-17 11:45:09,024 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 7 [2025-03-17 11:45:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:09,025 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-17 11:45:09,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:45:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-03-17 11:45:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:45:09,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:09,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:09,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:45:09,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:09,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:09,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1222734738, now seen corresponding path program 1 times [2025-03-17 11:45:09,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:09,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222396668] [2025-03-17 11:45:09,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:09,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:45:09,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:45:09,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:09,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:09,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:45:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222396668] [2025-03-17 11:45:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222396668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:09,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909548372] [2025-03-17 11:45:09,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:09,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:09,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:09,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:09,161 INFO L87 Difference]: Start difference. First operand 41 states and 49 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:45:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:09,197 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-17 11:45:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:09,197 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:45:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:09,198 INFO L225 Difference]: With dead ends: 39 [2025-03-17 11:45:09,198 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 11:45:09,198 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:45:09,198 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:09,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 46 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 11:45:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 11:45:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 38 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:45:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-03-17 11:45:09,201 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 7 [2025-03-17 11:45:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:09,201 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-17 11:45:09,201 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:45:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-03-17 11:45:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:45:09,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:09,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:09,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:45:09,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:09,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1222734737, now seen corresponding path program 1 times [2025-03-17 11:45:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:09,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25751433] [2025-03-17 11:45:09,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:09,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:09,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:45:09,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:45:09,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:09,391 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:45:09,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:09,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25751433] [2025-03-17 11:45:09,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25751433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:09,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:09,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936646535] [2025-03-17 11:45:09,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:09,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:45:09,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:09,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:45:09,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:09,392 INFO L87 Difference]: Start difference. First operand 39 states and 47 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:45:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:09,490 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-03-17 11:45:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:09,490 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:45:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:09,491 INFO L225 Difference]: With dead ends: 43 [2025-03-17 11:45:09,492 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 11:45:09,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:45:09,493 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:09,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 87 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 11:45:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-03-17 11:45:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 40 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:45:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-17 11:45:09,497 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 7 [2025-03-17 11:45:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:09,497 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-17 11:45:09,497 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:45:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-17 11:45:09,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:45:09,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:09,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:09,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:45:09,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:09,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash -166208942, now seen corresponding path program 1 times [2025-03-17 11:45:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:09,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217558503] [2025-03-17 11:45:09,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:09,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:45:09,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:45:09,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:09,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:09,530 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:45:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:09,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217558503] [2025-03-17 11:45:09,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217558503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:09,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202164408] [2025-03-17 11:45:09,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:09,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:09,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:09,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:09,535 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:45:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:09,558 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-03-17 11:45:09,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:09,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:45:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:09,559 INFO L225 Difference]: With dead ends: 39 [2025-03-17 11:45:09,559 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 11:45:09,559 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:45:09,559 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:09,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 11:45:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 11:45:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 38 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:45:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-17 11:45:09,565 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 8 [2025-03-17 11:45:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:09,565 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-17 11:45:09,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:45:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-17 11:45:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:45:09,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:09,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:09,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:45:09,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:09,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash -166208941, now seen corresponding path program 1 times [2025-03-17 11:45:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:09,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930340867] [2025-03-17 11:45:09,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:09,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:45:09,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:45:09,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:09,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:09,719 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:45:09,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:09,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930340867] [2025-03-17 11:45:09,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930340867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:09,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:09,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:45:09,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198635786] [2025-03-17 11:45:09,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:09,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:45:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:09,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:45:09,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:09,721 INFO L87 Difference]: Start difference. First operand 39 states and 48 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:45:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:09,765 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-03-17 11:45:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:09,765 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:45:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:09,766 INFO L225 Difference]: With dead ends: 49 [2025-03-17 11:45:09,766 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 11:45:09,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:09,766 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:09,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 11:45:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-03-17 11:45:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 43 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:45:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-03-17 11:45:09,769 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 8 [2025-03-17 11:45:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:09,769 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-03-17 11:45:09,769 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:45:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-03-17 11:45:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:45:09,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:09,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:09,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:45:09,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:09,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:09,770 INFO L85 PathProgramCache]: Analyzing trace with hash -137579790, now seen corresponding path program 1 times [2025-03-17 11:45:09,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:09,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051330135] [2025-03-17 11:45:09,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:09,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:09,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:45:09,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:45:09,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:09,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:09,882 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:45:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051330135] [2025-03-17 11:45:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051330135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:09,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:45:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215407018] [2025-03-17 11:45:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:09,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:45:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:09,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:45:09,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:09,883 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) 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:45:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:09,944 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-03-17 11:45:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) 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:45:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:09,946 INFO L225 Difference]: With dead ends: 47 [2025-03-17 11:45:09,946 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 11:45:09,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:45:09,947 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:09,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 72 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 11:45:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2025-03-17 11:45:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 40 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:45:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-17 11:45:09,952 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 8 [2025-03-17 11:45:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:09,952 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-17 11:45:09,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) 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:45:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-17 11:45:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:45:09,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:09,952 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:09,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:45:09,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:09,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash -872935305, now seen corresponding path program 1 times [2025-03-17 11:45:09,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:09,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338918581] [2025-03-17 11:45:09,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:09,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:09,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:09,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:09,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:10,127 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:45:10,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338918581] [2025-03-17 11:45:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338918581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603601824] [2025-03-17 11:45:10,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:10,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:10,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:10,130 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:45:10,132 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:45:10,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:10,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:10,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:10,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:10,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 11:45:10,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:10,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:10,252 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:45:10,257 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:45:10,421 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:45:10,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:10,571 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:45:10,608 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:45:10,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603601824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:10,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:10,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-03-17 11:45:10,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929321233] [2025-03-17 11:45:10,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:10,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:45:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:10,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:45:10,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:45:10,610 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:10,883 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2025-03-17 11:45:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:45:10,885 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:45:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:10,885 INFO L225 Difference]: With dead ends: 43 [2025-03-17 11:45:10,885 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 11:45:10,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:45:10,886 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:10,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 193 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 11:45:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2025-03-17 11:45:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-17 11:45:10,889 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 10 [2025-03-17 11:45:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:10,889 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-17 11:45:10,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-17 11:45:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:45:10,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:10,890 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:10,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:11,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:11,092 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:11,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash 566702285, now seen corresponding path program 1 times [2025-03-17 11:45:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:11,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722012014] [2025-03-17 11:45:11,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:11,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:45:11,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:45:11,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:11,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:11,138 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:45:11,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:11,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722012014] [2025-03-17 11:45:11,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722012014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:11,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259968797] [2025-03-17 11:45:11,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:11,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:11,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:11,141 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:45:11,142 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:45:11,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:45:11,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:45:11,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:11,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:11,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:45:11,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:11,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:45:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259968797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:11,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:45:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 11:45:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067363165] [2025-03-17 11:45:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:11,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:11,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:11,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:11,219 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:45:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:11,233 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-17 11:45:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:11,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:45:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:11,234 INFO L225 Difference]: With dead ends: 45 [2025-03-17 11:45:11,234 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 11:45:11,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:11,234 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:11,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 11:45:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 11:45:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.542857142857143) internal successors, (54), 44 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:45:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-03-17 11:45:11,236 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 11 [2025-03-17 11:45:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:11,236 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-03-17 11:45:11,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:45:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-03-17 11:45:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:45:11,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:11,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:11,245 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:45:11,439 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,SelfDestructingSolverStorable9 [2025-03-17 11:45:11,440 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:11,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash 566702125, now seen corresponding path program 1 times [2025-03-17 11:45:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:11,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364931999] [2025-03-17 11:45:11,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:11,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:45:11,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:45:11,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:11,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:11,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:11,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364931999] [2025-03-17 11:45:11,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364931999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:11,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:11,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849879797] [2025-03-17 11:45:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:11,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:11,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:11,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:11,551 INFO L87 Difference]: Start difference. First operand 45 states and 54 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:45:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:11,565 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-03-17 11:45:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:11,565 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:45:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:11,567 INFO L225 Difference]: With dead ends: 59 [2025-03-17 11:45:11,567 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 11:45:11,567 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:45:11,568 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:11,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 11:45:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-17 11:45:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-03-17 11:45:11,572 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 11 [2025-03-17 11:45:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:11,572 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-03-17 11:45:11,572 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:45:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-03-17 11:45:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:45:11,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:11,573 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:11,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:45:11,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:11,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:11,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1240752178, now seen corresponding path program 1 times [2025-03-17 11:45:11,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:11,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576351054] [2025-03-17 11:45:11,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:11,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:45:11,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:45:11,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:11,728 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:45:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:11,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576351054] [2025-03-17 11:45:11,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576351054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:11,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456946376] [2025-03-17 11:45:11,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:11,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:11,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:11,731 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:45:11,732 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:45:11,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:45:11,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:45:11,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:11,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:11,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:45:11,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:11,795 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:45:11,802 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:45:11,946 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:45:11,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:12,109 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:45:12,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456946376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:12,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:12,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-03-17 11:45:12,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474965915] [2025-03-17 11:45:12,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:12,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:45:12,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:12,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:45:12,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:45:12,111 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:12,297 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2025-03-17 11:45:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:45:12,297 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 11:45:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:12,298 INFO L225 Difference]: With dead ends: 61 [2025-03-17 11:45:12,298 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 11:45:12,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:45:12,299 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:12,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 199 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 11:45:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-17 11:45:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.434782608695652) internal successors, (66), 54 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:45:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-03-17 11:45:12,304 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 11 [2025-03-17 11:45:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:12,304 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-03-17 11:45:12,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-03-17 11:45:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:45:12,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:12,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:12,312 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:45:12,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:12,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:12,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash 370188620, now seen corresponding path program 1 times [2025-03-17 11:45:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:12,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412775832] [2025-03-17 11:45:12,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:12,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:45:12,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:45:12,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:12,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:12,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412775832] [2025-03-17 11:45:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412775832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:12,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374891974] [2025-03-17 11:45:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:12,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:12,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:12,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:12,592 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 5 states, 4 states have (on average 2.75) 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:45:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:12,613 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-03-17 11:45:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:12,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) 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:45:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:12,614 INFO L225 Difference]: With dead ends: 54 [2025-03-17 11:45:12,614 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 11:45:12,614 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:45:12,615 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:12,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 11:45:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2025-03-17 11:45:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.5) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-17 11:45:12,617 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 11 [2025-03-17 11:45:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:12,617 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-17 11:45:12,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) 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:45:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-17 11:45:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:45:12,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:12,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:12,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:45:12,618 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:12,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash 387896655, now seen corresponding path program 1 times [2025-03-17 11:45:12,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:12,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485749962] [2025-03-17 11:45:12,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:12,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:12,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:45:12,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:45:12,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:12,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:12,709 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:45:12,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485749962] [2025-03-17 11:45:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485749962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984713914] [2025-03-17 11:45:12,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:12,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:12,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:12,712 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:45:12,714 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:45:12,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:45:12,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:45:12,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:12,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:12,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:45:12,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:12,841 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:45:12,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:12,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-17 11:45:12,933 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:45:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984713914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:12,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-17 11:45:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983531254] [2025-03-17 11:45:12,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:45:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:12,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:45:12,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:45:12,934 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:13,126 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-17 11:45:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:45:13,127 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:45:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:13,127 INFO L225 Difference]: With dead ends: 56 [2025-03-17 11:45:13,127 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 11:45:13,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:45:13,128 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 56 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:13,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 235 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 11:45:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-17 11:45:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 53 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:45:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-17 11:45:13,130 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 12 [2025-03-17 11:45:13,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:13,130 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-17 11:45:13,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-17 11:45:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:45:13,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:13,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:13,139 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:45:13,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:13,338 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:13,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash 191383150, now seen corresponding path program 1 times [2025-03-17 11:45:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:13,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770284042] [2025-03-17 11:45:13,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:13,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:45:13,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:45:13,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:13,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:13,419 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:45:13,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:13,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770284042] [2025-03-17 11:45:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770284042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:13,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674763331] [2025-03-17 11:45:13,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:13,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:13,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:13,422 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:45:13,423 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:45:13,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:45:13,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:45:13,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:13,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:13,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:45:13,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:13,538 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:45:13,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:45:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674763331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:13,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:45:13,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-03-17 11:45:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045172298] [2025-03-17 11:45:13,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:13,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:45:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:13,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:45:13,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:45:13,539 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:13,625 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-03-17 11:45:13,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:45:13,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:45:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:13,626 INFO L225 Difference]: With dead ends: 55 [2025-03-17 11:45:13,626 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 11:45:13,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:45:13,626 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:13,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 92 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 11:45:13,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2025-03-17 11:45:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 40 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:45:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-17 11:45:13,630 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 12 [2025-03-17 11:45:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:13,630 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-17 11:45:13,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-17 11:45:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:45:13,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:13,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:13,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 11:45:13,830 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,SelfDestructingSolverStorable14 [2025-03-17 11:45:13,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:13,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash -893470486, now seen corresponding path program 1 times [2025-03-17 11:45:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199106555] [2025-03-17 11:45:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:13,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:45:13,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:45:13,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:13,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:13,862 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:45:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:13,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199106555] [2025-03-17 11:45:13,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199106555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:13,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:13,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501476095] [2025-03-17 11:45:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:13,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:13,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:13,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:13,864 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:13,886 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-03-17 11:45:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:13,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 11:45:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:13,887 INFO L225 Difference]: With dead ends: 40 [2025-03-17 11:45:13,887 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 11:45:13,887 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:45:13,888 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:13,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 43 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 11:45:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 11:45:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 39 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:45:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-17 11:45:13,890 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 14 [2025-03-17 11:45:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:13,890 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-17 11:45:13,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2025-03-17 11:45:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:45:13,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:13,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:13,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:45:13,891 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:13,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash -893470485, now seen corresponding path program 1 times [2025-03-17 11:45:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:13,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494972136] [2025-03-17 11:45:13,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:13,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:45:13,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:45:13,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:13,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:13,974 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:45:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494972136] [2025-03-17 11:45:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494972136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395871975] [2025-03-17 11:45:13,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:13,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:13,976 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:45:13,978 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:45:14,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:45:14,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:45:14,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:14,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:14,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 11:45:14,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:14,071 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:45:14,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:14,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-17 11:45:14,103 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:45:14,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395871975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:14,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:14,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-17 11:45:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090184208] [2025-03-17 11:45:14,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:14,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:45:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:14,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:45:14,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:45:14,104 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 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:45:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:14,159 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2025-03-17 11:45:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:45:14,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 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 14 [2025-03-17 11:45:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:14,159 INFO L225 Difference]: With dead ends: 46 [2025-03-17 11:45:14,159 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 11:45:14,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:45:14,160 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:14,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 134 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 11:45:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-03-17 11:45:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 40 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:45:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-17 11:45:14,161 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 14 [2025-03-17 11:45:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:14,161 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-17 11:45:14,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 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:45:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-17 11:45:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:45:14,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:14,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:14,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:14,362 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,SelfDestructingSolverStorable16 [2025-03-17 11:45:14,362 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:14,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash 368321772, now seen corresponding path program 1 times [2025-03-17 11:45:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343246613] [2025-03-17 11:45:14,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:14,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:14,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:45:14,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:45:14,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:14,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:14,616 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:45:14,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:14,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343246613] [2025-03-17 11:45:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343246613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:14,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120685949] [2025-03-17 11:45:14,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:14,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:14,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:14,619 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:45:14,620 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:45:14,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:45:14,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:45:14,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:14,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:14,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 11:45:14,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:14,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:45:14,800 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:45:14,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:14,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 11:45:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:14,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:45:14,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120685949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:14,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:45:14,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2025-03-17 11:45:14,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251133267] [2025-03-17 11:45:14,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:14,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:45:14,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:14,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:45:14,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:45:14,817 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:14,907 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2025-03-17 11:45:14,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:45:14,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 11:45:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:14,907 INFO L225 Difference]: With dead ends: 47 [2025-03-17 11:45:14,907 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 11:45:14,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:45:14,908 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:14,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 132 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 11:45:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-03-17 11:45:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.375) internal successors, (55), 45 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:45:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-03-17 11:45:14,910 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 16 [2025-03-17 11:45:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:14,910 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-03-17 11:45:14,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2025-03-17 11:45:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:45:14,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:14,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:14,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 11:45:15,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:15,115 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:15,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash -137236853, now seen corresponding path program 1 times [2025-03-17 11:45:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:15,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822923532] [2025-03-17 11:45:15,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:15,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:45:15,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:45:15,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:15,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:15,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822923532] [2025-03-17 11:45:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822923532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790378725] [2025-03-17 11:45:15,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:15,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:15,276 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:45:15,277 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:45:15,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:45:15,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:45:15,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:15,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:15,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 11:45:15,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:15,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:45:15,481 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:45:15,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:15,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 11:45:15,496 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:45:15,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:15,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-17 11:45:15,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 11:45:15,641 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:45:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790378725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:15,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:15,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2025-03-17 11:45:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316798490] [2025-03-17 11:45:15,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:15,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:45:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:15,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:45:15,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:45:15,642 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 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:45:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:16,059 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2025-03-17 11:45:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:45:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 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) Word has length 16 [2025-03-17 11:45:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:16,060 INFO L225 Difference]: With dead ends: 73 [2025-03-17 11:45:16,060 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 11:45:16,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 11:45:16,061 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 72 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:16,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 178 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 11:45:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2025-03-17 11:45:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-03-17 11:45:16,063 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 16 [2025-03-17 11:45:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:16,063 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-03-17 11:45:16,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 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:45:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-03-17 11:45:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:45:16,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:16,064 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:45:16,070 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:45:16,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:16,268 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:16,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1466928154, now seen corresponding path program 1 times [2025-03-17 11:45:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:16,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902064040] [2025-03-17 11:45:16,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:16,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:45:16,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:45:16,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:16,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902064040] [2025-03-17 11:45:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902064040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:16,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:16,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102473388] [2025-03-17 11:45:16,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:16,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:16,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:16,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:16,319 INFO L87 Difference]: Start difference. First operand 51 states and 62 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:45:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:16,348 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-17 11:45:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:16,348 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:45:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:16,348 INFO L225 Difference]: With dead ends: 50 [2025-03-17 11:45:16,348 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 11:45:16,349 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:45:16,349 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:16,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 11:45:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 11:45:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 49 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:45:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-17 11:45:16,351 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 17 [2025-03-17 11:45:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:16,351 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-17 11:45:16,351 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:45:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-17 11:45:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:45:16,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:16,352 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:45:16,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:45:16,352 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:16,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1466928153, now seen corresponding path program 1 times [2025-03-17 11:45:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:16,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108618866] [2025-03-17 11:45:16,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:16,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:45:16,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:45:16,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:16,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:16,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:16,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108618866] [2025-03-17 11:45:16,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108618866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:16,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:16,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:45:16,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114068988] [2025-03-17 11:45:16,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:16,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:45:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:16,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:45:16,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:16,435 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:16,486 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2025-03-17 11:45:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:45:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 11:45:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:16,486 INFO L225 Difference]: With dead ends: 63 [2025-03-17 11:45:16,486 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 11:45:16,487 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:45:16,487 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:16,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 101 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 11:45:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2025-03-17 11:45:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 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:45:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-03-17 11:45:16,488 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 17 [2025-03-17 11:45:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:16,488 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-17 11:45:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-03-17 11:45:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:45:16,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:16,489 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:45:16,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:45:16,489 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:16,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:16,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1769867459, now seen corresponding path program 1 times [2025-03-17 11:45:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:16,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516552334] [2025-03-17 11:45:16,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:16,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:45:16,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:45:16,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:16,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:16,526 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:45:16,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:16,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516552334] [2025-03-17 11:45:16,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516552334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:16,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:16,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:16,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251323952] [2025-03-17 11:45:16,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:16,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:16,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:16,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:16,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:16,528 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:45:16,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:16,561 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2025-03-17 11:45:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:16,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:45:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:16,562 INFO L225 Difference]: With dead ends: 51 [2025-03-17 11:45:16,562 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 11:45:16,562 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:45:16,563 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:16,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 54 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 11:45:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 11:45:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-03-17 11:45:16,565 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 18 [2025-03-17 11:45:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:16,565 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-03-17 11:45:16,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:45:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-03-17 11:45:16,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:45:16,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:16,567 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:45:16,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:45:16,567 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:16,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1769867460, now seen corresponding path program 1 times [2025-03-17 11:45:16,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:16,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567948882] [2025-03-17 11:45:16,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:16,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:45:16,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:45:16,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:16,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567948882] [2025-03-17 11:45:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567948882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:45:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205444402] [2025-03-17 11:45:16,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:16,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:45:16,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:16,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:45:16,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:16,658 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:16,686 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-03-17 11:45:16,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:16,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:16,687 INFO L225 Difference]: With dead ends: 54 [2025-03-17 11:45:16,687 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 11:45:16,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:16,687 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:16,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 11:45:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 11:45:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.3) internal successors, (65), 53 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:45:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-17 11:45:16,688 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 18 [2025-03-17 11:45:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:16,688 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-17 11:45:16,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-17 11:45:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:45:16,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:16,689 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:16,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:45:16,689 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:16,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:16,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1102920802, now seen corresponding path program 1 times [2025-03-17 11:45:16,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:16,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007655430] [2025-03-17 11:45:16,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:16,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:16,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:16,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:16,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:16,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007655430] [2025-03-17 11:45:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007655430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:16,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:45:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435344472] [2025-03-17 11:45:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:16,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:45:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:16,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:45:16,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:45:16,808 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:16,839 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2025-03-17 11:45:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:45:16,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:45:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:16,840 INFO L225 Difference]: With dead ends: 90 [2025-03-17 11:45:16,840 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 11:45:16,840 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:45:16,841 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:16,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 139 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 11:45:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-17 11:45:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 87 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:45:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2025-03-17 11:45:16,843 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 21 [2025-03-17 11:45:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:16,843 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2025-03-17 11:45:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2025-03-17 11:45:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:45:16,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:16,843 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:45:16,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:45:16,843 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:16,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:16,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1102921473, now seen corresponding path program 1 times [2025-03-17 11:45:16,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:16,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142280474] [2025-03-17 11:45:16,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:16,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:16,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:16,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:16,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:16,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:16,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:16,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142280474] [2025-03-17 11:45:16,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142280474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:16,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:16,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:16,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745011718] [2025-03-17 11:45:16,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:16,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:16,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:16,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:16,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:16,921 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:16,934 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2025-03-17 11:45:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:16,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:45:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:16,935 INFO L225 Difference]: With dead ends: 87 [2025-03-17 11:45:16,935 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 11:45:16,935 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:45:16,935 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:16,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:16,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 11:45:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 11:45:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 68 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:45:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2025-03-17 11:45:16,937 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 21 [2025-03-17 11:45:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:16,937 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2025-03-17 11:45:16,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2025-03-17 11:45:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:45:16,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:16,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:16,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:45:16,937 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:16,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1658717080, now seen corresponding path program 2 times [2025-03-17 11:45:16,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:16,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809357120] [2025-03-17 11:45:16,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:16,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 11:45:16,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:16,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:16,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:17,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:17,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809357120] [2025-03-17 11:45:17,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809357120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972126348] [2025-03-17 11:45:17,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:17,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:17,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:17,239 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:45:17,240 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:45:17,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 11:45:17,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:17,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:17,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:17,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 11:45:17,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:17,464 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:45:17,606 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-03-17 11:45:17,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 18 [2025-03-17 11:45:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:17,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:17,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 11:45:17,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:17,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2025-03-17 11:45:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:17,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972126348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:17,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:17,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 36 [2025-03-17 11:45:17,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365643517] [2025-03-17 11:45:17,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:17,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 11:45:17,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:17,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 11:45:17,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 11:45:17,942 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:19,616 INFO L93 Difference]: Finished difference Result 154 states and 180 transitions. [2025-03-17 11:45:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-17 11:45:19,616 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:45:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:19,617 INFO L225 Difference]: With dead ends: 154 [2025-03-17 11:45:19,617 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 11:45:19,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=972, Invalid=5348, Unknown=0, NotChecked=0, Total=6320 [2025-03-17 11:45:19,618 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 320 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:19,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 253 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:45:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 11:45:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 113. [2025-03-17 11:45:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 112 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:45:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2025-03-17 11:45:19,621 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 21 [2025-03-17 11:45:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:19,621 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2025-03-17 11:45:19,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2025-03-17 11:45:19,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:45:19,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:19,622 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:19,628 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:45:19,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 11:45:19,826 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:19,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash 694096577, now seen corresponding path program 1 times [2025-03-17 11:45:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:19,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182773122] [2025-03-17 11:45:19,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:19,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:19,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:19,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:19,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:19,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:19,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:19,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182773122] [2025-03-17 11:45:19,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182773122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:19,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:19,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:45:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070526246] [2025-03-17 11:45:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:19,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:45:19,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:19,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:45:19,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:45:19,946 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:20,006 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2025-03-17 11:45:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:45:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:45:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:20,007 INFO L225 Difference]: With dead ends: 122 [2025-03-17 11:45:20,007 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 11:45:20,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:45:20,007 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:20,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 142 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 11:45:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 11:45:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 103 states have (on average 1.2233009708737863) internal successors, (126), 105 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:45:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2025-03-17 11:45:20,010 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2025-03-17 11:45:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:20,010 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2025-03-17 11:45:20,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2025-03-17 11:45:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:45:20,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:20,010 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:20,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:45:20,010 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:20,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash -150375294, now seen corresponding path program 1 times [2025-03-17 11:45:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:20,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780719485] [2025-03-17 11:45:20,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:20,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:20,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:20,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:20,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:20,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780719485] [2025-03-17 11:45:20,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780719485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:20,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:20,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:45:20,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038526242] [2025-03-17 11:45:20,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:20,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:45:20,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:20,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:45:20,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:45:20,154 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:20,196 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2025-03-17 11:45:20,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:45:20,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:45:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:20,197 INFO L225 Difference]: With dead ends: 160 [2025-03-17 11:45:20,197 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 11:45:20,197 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:45:20,197 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:20,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 116 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 11:45:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2025-03-17 11:45:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 107 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2025-03-17 11:45:20,201 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 21 [2025-03-17 11:45:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:20,202 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2025-03-17 11:45:20,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2025-03-17 11:45:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:45:20,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:20,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:20,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:45:20,203 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:20,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash -594284224, now seen corresponding path program 1 times [2025-03-17 11:45:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:20,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342177128] [2025-03-17 11:45:20,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:20,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:45:20,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:20,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:20,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:20,338 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:45:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342177128] [2025-03-17 11:45:20,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342177128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9057071] [2025-03-17 11:45:20,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:20,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:20,340 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:45:20,342 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:45:20,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:45:20,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:20,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:20,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:20,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:45:20,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:20,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:20,533 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:45:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9057071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:20,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-17 11:45:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818153192] [2025-03-17 11:45:20,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:20,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:45:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:20,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:45:20,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:45:20,550 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:20,682 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2025-03-17 11:45:20,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:45:20,684 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:45:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:20,684 INFO L225 Difference]: With dead ends: 124 [2025-03-17 11:45:20,684 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 11:45:20,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:45:20,685 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:20,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 159 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 11:45:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-03-17 11:45:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 90 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:45:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2025-03-17 11:45:20,686 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 23 [2025-03-17 11:45:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:20,686 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2025-03-17 11:45:20,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2025-03-17 11:45:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:45:20,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:20,687 INFO L218 NwaCegarLoop]: trace histogram [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:45:20,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:20,887 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,SelfDestructingSolverStorable28 [2025-03-17 11:45:20,887 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:20,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash 231164554, now seen corresponding path program 1 times [2025-03-17 11:45:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:20,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262533101] [2025-03-17 11:45:20,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:20,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:20,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:45:20,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:45:20,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:20,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262533101] [2025-03-17 11:45:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262533101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566940940] [2025-03-17 11:45:20,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:20,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:20,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:20,951 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:45:20,953 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:45:21,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:45:21,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:45:21,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:21,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:21,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:45:21,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:21,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:21,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566940940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:21,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:21,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-17 11:45:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026486467] [2025-03-17 11:45:21,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:21,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:45:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:21,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:45:21,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:45:21,084 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:21,195 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2025-03-17 11:45:21,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:45:21,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-17 11:45:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:21,196 INFO L225 Difference]: With dead ends: 94 [2025-03-17 11:45:21,196 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 11:45:21,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:45:21,196 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:21,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 153 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 11:45:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2025-03-17 11:45:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 87 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2025-03-17 11:45:21,198 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 24 [2025-03-17 11:45:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:21,198 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2025-03-17 11:45:21,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2025-03-17 11:45:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:45:21,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:21,199 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:21,205 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:45:21,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:21,401 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:21,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1819983053, now seen corresponding path program 3 times [2025-03-17 11:45:21,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:21,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296047517] [2025-03-17 11:45:21,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:21,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-17 11:45:21,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:45:21,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 11:45:21,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296047517] [2025-03-17 11:45:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296047517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034376436] [2025-03-17 11:45:21,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:21,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:21,766 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:45:21,767 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:45:21,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-17 11:45:21,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:45:21,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 11:45:21,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:21,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 11:45:21,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:21,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:45:22,144 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-03-17 11:45:22,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2025-03-17 11:45:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 11:45:22,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:22,598 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 40 treesize of output 34 [2025-03-17 11:45:22,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:22,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2025-03-17 11:45:22,629 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:45:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:45:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034376436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:22,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:22,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 30 [2025-03-17 11:45:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957056945] [2025-03-17 11:45:22,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:22,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 11:45:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:22,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 11:45:22,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:45:22,686 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 31 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:45:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:23,425 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2025-03-17 11:45:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 11:45:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.8) internal successors, (54), 31 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 11:45:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:23,426 INFO L225 Difference]: With dead ends: 120 [2025-03-17 11:45:23,426 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 11:45:23,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=376, Invalid=2174, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 11:45:23,427 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 117 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:23,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 145 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:45:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 11:45:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2025-03-17 11:45:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.206896551724138) internal successors, (70), 59 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2025-03-17 11:45:23,429 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 26 [2025-03-17 11:45:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:23,429 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2025-03-17 11:45:23,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.8) internal successors, (54), 31 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:45:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2025-03-17 11:45:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 11:45:23,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:23,429 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] [2025-03-17 11:45:23,437 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:45:23,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:23,630 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:23,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 906042624, now seen corresponding path program 2 times [2025-03-17 11:45:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:23,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260756288] [2025-03-17 11:45:23,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:23,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:23,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 11:45:23,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:45:23,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:23,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:23,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260756288] [2025-03-17 11:45:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260756288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605804246] [2025-03-17 11:45:23,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:23,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:23,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:23,769 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:45:23,771 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:45:23,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 11:45:23,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:45:23,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:23,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:23,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 11:45:23,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:23,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:24,002 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:45:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605804246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:24,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:24,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-03-17 11:45:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60938389] [2025-03-17 11:45:24,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:24,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:45:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:24,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:45:24,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:45:24,027 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:24,131 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-03-17 11:45:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:45:24,132 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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 27 [2025-03-17 11:45:24,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:24,132 INFO L225 Difference]: With dead ends: 68 [2025-03-17 11:45:24,132 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 11:45:24,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:45:24,133 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:24,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 11:45:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-03-17 11:45:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 63 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:45:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-03-17 11:45:24,135 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 27 [2025-03-17 11:45:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:24,135 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-03-17 11:45:24,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-03-17 11:45:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 11:45:24,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:24,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:24,142 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:45:24,340 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,SelfDestructingSolverStorable31 [2025-03-17 11:45:24,340 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:24,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 372251980, now seen corresponding path program 1 times [2025-03-17 11:45:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716713493] [2025-03-17 11:45:24,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:24,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:45:24,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:45:24,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:24,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716713493] [2025-03-17 11:45:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716713493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892545768] [2025-03-17 11:45:24,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:24,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:24,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:24,654 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:45:24,656 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:45:24,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:45:24,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:45:24,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:24,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:24,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 11:45:24,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:24,869 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:45:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:24,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:24,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-17 11:45:24,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 11:45:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:25,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892545768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:25,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:25,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2025-03-17 11:45:25,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673162502] [2025-03-17 11:45:25,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:25,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 11:45:25,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:25,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 11:45:25,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:45:25,057 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 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:45:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:26,105 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2025-03-17 11:45:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 11:45:26,105 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 11:45:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:26,106 INFO L225 Difference]: With dead ends: 92 [2025-03-17 11:45:26,106 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 11:45:26,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=526, Invalid=2554, Unknown=0, NotChecked=0, Total=3080 [2025-03-17 11:45:26,107 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:26,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:45:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 11:45:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2025-03-17 11:45:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 73 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:45:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-03-17 11:45:26,108 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 30 [2025-03-17 11:45:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:26,108 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-03-17 11:45:26,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 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:45:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-03-17 11:45:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 11:45:26,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:26,109 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:26,115 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:45:26,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:26,313 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:26,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash -435048197, now seen corresponding path program 3 times [2025-03-17 11:45:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015570198] [2025-03-17 11:45:26,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:26,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-17 11:45:26,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:45:26,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:45:26,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:26,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:26,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015570198] [2025-03-17 11:45:26,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015570198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:26,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569653671] [2025-03-17 11:45:26,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:26,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:26,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:26,512 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:45:26,513 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:45:26,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-17 11:45:26,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:45:26,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:45:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:26,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 11:45:26,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:26,683 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:45:26,696 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:45:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:26,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:26,777 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:45:26,782 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:45:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569653671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:26,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:26,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2025-03-17 11:45:26,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63869518] [2025-03-17 11:45:26,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:26,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:45:26,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:26,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:45:26,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:45:26,838 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 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:45:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:26,925 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2025-03-17 11:45:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:45:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-17 11:45:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:26,925 INFO L225 Difference]: With dead ends: 139 [2025-03-17 11:45:26,925 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 11:45:26,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:45:26,926 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:26,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 11:45:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2025-03-17 11:45:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2025-03-17 11:45:26,928 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 31 [2025-03-17 11:45:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:26,928 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2025-03-17 11:45:26,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 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:45:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2025-03-17 11:45:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 11:45:26,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:26,928 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:26,934 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:45:27,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:27,129 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:27,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:27,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1226939651, now seen corresponding path program 4 times [2025-03-17 11:45:27,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:27,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593871509] [2025-03-17 11:45:27,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:27,135 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-17 11:45:27,154 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 34 statements. [2025-03-17 11:45:27,154 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:45:27,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 11:45:27,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:27,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593871509] [2025-03-17 11:45:27,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593871509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:27,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113291290] [2025-03-17 11:45:27,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:27,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:27,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:27,443 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:45:27,444 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:45:27,506 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-17 11:45:27,526 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 34 statements. [2025-03-17 11:45:27,526 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:45:27,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:27,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 11:45:27,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:27,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:45:28,218 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2025-03-17 11:45:28,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2025-03-17 11:45:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 6 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 11:45:28,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:28,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 11:45:28,526 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:45:28,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-03-17 11:45:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 11:45:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113291290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:28,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:28,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-17 11:45:28,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410177050] [2025-03-17 11:45:28,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:28,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 11:45:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:28,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 11:45:28,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=650, Unknown=1, NotChecked=0, Total=756 [2025-03-17 11:45:28,550 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 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:45:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:28,780 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2025-03-17 11:45:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:45:28,780 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 11:45:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:28,781 INFO L225 Difference]: With dead ends: 105 [2025-03-17 11:45:28,781 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 11:45:28,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=788, Unknown=1, NotChecked=0, Total=930 [2025-03-17 11:45:28,781 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:28,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 153 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 11:45:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2025-03-17 11:45:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.141304347826087) internal successors, (105), 92 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:45:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2025-03-17 11:45:28,783 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 34 [2025-03-17 11:45:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:28,783 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2025-03-17 11:45:28,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 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:45:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2025-03-17 11:45:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:45:28,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:28,784 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:28,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:28,988 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,SelfDestructingSolverStorable34 [2025-03-17 11:45:28,988 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:28,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash 789846019, now seen corresponding path program 2 times [2025-03-17 11:45:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713264985] [2025-03-17 11:45:28,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:28,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 11:45:28,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:45:28,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:28,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:29,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:29,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713264985] [2025-03-17 11:45:29,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713264985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:29,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732023381] [2025-03-17 11:45:29,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:29,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:29,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:29,345 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:45:29,347 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:45:29,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 11:45:29,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:45:29,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:29,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:29,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 11:45:29,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:29,640 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:45:29,790 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-03-17 11:45:29,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 18 [2025-03-17 11:45:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:29,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:29,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 11:45:29,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:29,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2025-03-17 11:45:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:30,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732023381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:30,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2025-03-17 11:45:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063216683] [2025-03-17 11:45:30,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:30,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 11:45:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:30,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 11:45:30,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 11:45:30,108 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 40 states, 40 states have (on average 2.225) internal successors, (89), 40 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:45:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:31,289 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2025-03-17 11:45:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 11:45:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.225) internal successors, (89), 40 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) Word has length 35 [2025-03-17 11:45:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:31,290 INFO L225 Difference]: With dead ends: 168 [2025-03-17 11:45:31,290 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 11:45:31,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=580, Invalid=3976, Unknown=0, NotChecked=0, Total=4556 [2025-03-17 11:45:31,292 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 130 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:31,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 263 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:45:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 11:45:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2025-03-17 11:45:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 119 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:45:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2025-03-17 11:45:31,297 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 35 [2025-03-17 11:45:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:31,297 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2025-03-17 11:45:31,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.225) internal successors, (89), 40 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:45:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2025-03-17 11:45:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 11:45:31,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:31,297 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:31,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:31,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:31,498 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:31,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash 779253773, now seen corresponding path program 1 times [2025-03-17 11:45:31,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:31,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671810900] [2025-03-17 11:45:31,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:31,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:31,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:45:31,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:45:31,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:31,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:45:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671810900] [2025-03-17 11:45:31,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671810900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269466282] [2025-03-17 11:45:31,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:31,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:31,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:31,592 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:45:31,593 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:45:31,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:45:31,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:45:31,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:31,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:31,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:45:31,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:45:31,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:45:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269466282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:31,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:31,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-17 11:45:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455833077] [2025-03-17 11:45:31,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:31,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:45:31,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:31,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:45:31,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:45:31,813 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:31,924 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2025-03-17 11:45:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:45:31,924 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 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:45:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:31,925 INFO L225 Difference]: With dead ends: 119 [2025-03-17 11:45:31,925 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 11:45:31,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:45:31,926 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:31,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 76 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 11:45:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2025-03-17 11:45:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.1293103448275863) internal successors, (131), 116 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:45:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2025-03-17 11:45:31,930 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 39 [2025-03-17 11:45:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:31,930 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2025-03-17 11:45:31,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2025-03-17 11:45:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:45:31,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:31,931 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:31,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:32,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:32,132 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:32,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash 219652558, now seen corresponding path program 3 times [2025-03-17 11:45:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854934829] [2025-03-17 11:45:32,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:32,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 5 equivalence classes. [2025-03-17 11:45:32,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 40 statements. [2025-03-17 11:45:32,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 11:45:32,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:45:32,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:32,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854934829] [2025-03-17 11:45:32,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854934829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:32,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923634917] [2025-03-17 11:45:32,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:32,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:32,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:32,852 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:45:32,853 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:45:32,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 5 equivalence classes. [2025-03-17 11:45:32,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 40 statements. [2025-03-17 11:45:32,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 11:45:32,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:32,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-17 11:45:32,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:33,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:45:33,410 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-03-17 11:45:33,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2025-03-17 11:45:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 11:45:33,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:34,081 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 40 treesize of output 34 [2025-03-17 11:45:34,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:34,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2025-03-17 11:45:34,265 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 52 treesize of output 44 [2025-03-17 11:45:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 11:45:34,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923634917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:34,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:34,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 49 [2025-03-17 11:45:34,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370654939] [2025-03-17 11:45:34,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:34,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-17 11:45:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:34,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-17 11:45:34,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2256, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 11:45:34,401 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 50 states, 49 states have (on average 1.816326530612245) internal successors, (89), 50 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:45:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:35,400 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2025-03-17 11:45:35,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 11:45:35,401 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.816326530612245) internal successors, (89), 50 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) Word has length 40 [2025-03-17 11:45:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:35,401 INFO L225 Difference]: With dead ends: 136 [2025-03-17 11:45:35,401 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 11:45:35,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=548, Invalid=4708, Unknown=0, NotChecked=0, Total=5256 [2025-03-17 11:45:35,402 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 78 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:35,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 130 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:45:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 11:45:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2025-03-17 11:45:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 85 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:45:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2025-03-17 11:45:35,404 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 40 [2025-03-17 11:45:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:35,404 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2025-03-17 11:45:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.816326530612245) internal successors, (89), 50 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:45:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2025-03-17 11:45:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 11:45:35,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:35,404 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:35,411 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:45:35,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:35,605 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:35,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 471561876, now seen corresponding path program 4 times [2025-03-17 11:45:35,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:35,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529170771] [2025-03-17 11:45:35,606 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:35,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:35,613 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-17 11:45:35,625 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:45:35,625 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:45:35,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 11:45:35,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:35,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529170771] [2025-03-17 11:45:35,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529170771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:35,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800699548] [2025-03-17 11:45:35,952 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:35,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:35,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:35,954 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:45:35,956 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:45:36,022 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-17 11:45:36,078 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:45:36,078 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:45:36,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:36,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 11:45:36,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:36,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:45:36,213 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 11:45:36,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:36,238 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:45:36,240 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:45:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 11:45:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800699548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:36,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 27 [2025-03-17 11:45:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705195221] [2025-03-17 11:45:36,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 11:45:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:36,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 11:45:36,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:45:36,293 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:36,411 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2025-03-17 11:45:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:45:36,411 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 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:45:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:36,412 INFO L225 Difference]: With dead ends: 178 [2025-03-17 11:45:36,412 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 11:45:36,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:45:36,412 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:36,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 218 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 11:45:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2025-03-17 11:45:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.119047619047619) internal successors, (141), 126 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2025-03-17 11:45:36,414 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 44 [2025-03-17 11:45:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:36,415 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2025-03-17 11:45:36,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2025-03-17 11:45:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 11:45:36,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:36,416 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:36,423 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:45:36,621 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,SelfDestructingSolverStorable38 [2025-03-17 11:45:36,621 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:36,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:36,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1673147563, now seen corresponding path program 5 times [2025-03-17 11:45:36,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:36,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309368170] [2025-03-17 11:45:36,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:45:36,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:36,628 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 5 equivalence classes. [2025-03-17 11:45:36,639 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:45:36,639 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 11:45:36,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:45:37,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309368170] [2025-03-17 11:45:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309368170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581018377] [2025-03-17 11:45:37,015 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:45:37,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:37,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:37,017 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:45:37,018 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:45:37,087 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 5 equivalence classes. [2025-03-17 11:45:37,144 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:45:37,144 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 11:45:37,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:37,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 11:45:37,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:37,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:45:37,450 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-03-17 11:45:37,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2025-03-17 11:45:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:45:37,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:37,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 11:45:37,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:37,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2025-03-17 11:45:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:45:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581018377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:37,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:37,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 44 [2025-03-17 11:45:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838333130] [2025-03-17 11:45:37,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:37,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-17 11:45:37,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:37,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-17 11:45:37,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1678, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 11:45:37,776 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:38,327 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2025-03-17 11:45:38,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:45:38,327 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 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:45:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:38,328 INFO L225 Difference]: With dead ends: 161 [2025-03-17 11:45:38,328 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 11:45:38,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=679, Invalid=3743, Unknown=0, NotChecked=0, Total=4422 [2025-03-17 11:45:38,329 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 117 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:38,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 128 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 11:45:38,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2025-03-17 11:45:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.121212121212121) internal successors, (148), 132 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2025-03-17 11:45:38,332 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 47 [2025-03-17 11:45:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:38,332 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2025-03-17 11:45:38,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2025-03-17 11:45:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 11:45:38,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:38,333 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:38,339 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:45:38,533 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,SelfDestructingSolverStorable39 [2025-03-17 11:45:38,533 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:38,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:38,534 INFO L85 PathProgramCache]: Analyzing trace with hash -298231924, now seen corresponding path program 6 times [2025-03-17 11:45:38,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:38,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476901980] [2025-03-17 11:45:38,534 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:45:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:38,541 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 4 equivalence classes. [2025-03-17 11:45:38,554 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:45:38,554 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-17 11:45:38,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 11:45:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476901980] [2025-03-17 11:45:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476901980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081521278] [2025-03-17 11:45:38,867 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:45:38,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:38,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:38,869 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:45:38,870 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:45:38,934 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 4 equivalence classes. [2025-03-17 11:45:38,964 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:45:38,964 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-17 11:45:38,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:38,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 11:45:38,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 11:45:39,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 11:45:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081521278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:39,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2025-03-17 11:45:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157099631] [2025-03-17 11:45:39,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:39,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 11:45:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:39,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 11:45:39,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:45:39,203 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 29 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:45:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:39,504 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2025-03-17 11:45:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:45:39,505 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 29 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 47 [2025-03-17 11:45:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:39,505 INFO L225 Difference]: With dead ends: 138 [2025-03-17 11:45:39,505 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 11:45:39,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 11:45:39,506 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:39,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 159 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 11:45:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2025-03-17 11:45:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 135 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2025-03-17 11:45:39,508 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 47 [2025-03-17 11:45:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:39,508 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2025-03-17 11:45:39,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 29 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:45:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2025-03-17 11:45:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:45:39,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:39,509 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:39,516 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:45:39,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:39,710 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash 776022833, now seen corresponding path program 7 times [2025-03-17 11:45:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:39,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024790963] [2025-03-17 11:45:39,710 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:45:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:39,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:45:39,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:45:39,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:39,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:40,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:40,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024790963] [2025-03-17 11:45:40,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024790963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:40,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889237026] [2025-03-17 11:45:40,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:45:40,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:40,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:40,126 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:45:40,127 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:45:40,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:45:40,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:45:40,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:40,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:40,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-17 11:45:40,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:40,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:45:40,683 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-17 11:45:40,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 26 [2025-03-17 11:45:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 11:45:40,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:40,841 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 38 [2025-03-17 11:45:40,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:40,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-03-17 11:45:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 17 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 11:45:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889237026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:41,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 52 [2025-03-17 11:45:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718550759] [2025-03-17 11:45:41,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:41,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 11:45:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:41,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 11:45:41,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2400, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 11:45:41,160 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 52 states, 52 states have (on average 2.2884615384615383) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:43,021 INFO L93 Difference]: Finished difference Result 259 states and 283 transitions. [2025-03-17 11:45:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-17 11:45:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.2884615384615383) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 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:45:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:43,022 INFO L225 Difference]: With dead ends: 259 [2025-03-17 11:45:43,022 INFO L226 Difference]: Without dead ends: 239 [2025-03-17 11:45:43,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 2532 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=946, Invalid=7610, Unknown=0, NotChecked=0, Total=8556 [2025-03-17 11:45:43,024 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 95 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:43,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 351 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 11:45:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-17 11:45:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 180. [2025-03-17 11:45:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.1173184357541899) internal successors, (200), 179 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2025-03-17 11:45:43,027 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 50 [2025-03-17 11:45:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:43,027 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2025-03-17 11:45:43,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.2884615384615383) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2025-03-17 11:45:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:45:43,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:43,027 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:43,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:43,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:43,228 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:43,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1352948182, now seen corresponding path program 8 times [2025-03-17 11:45:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991050202] [2025-03-17 11:45:43,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:43,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:43,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 11:45:43,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:45:43,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:43,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:45:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991050202] [2025-03-17 11:45:43,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991050202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497220511] [2025-03-17 11:45:43,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:43,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:43,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:43,609 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:45:43,610 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:45:43,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 11:45:43,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:45:43,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:43,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:43,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:45:43,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:43,921 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:45:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:45:43,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:43,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-17 11:45:43,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 11:45:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:45:44,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497220511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:44,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:44,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 39 [2025-03-17 11:45:44,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313486517] [2025-03-17 11:45:44,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:44,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 11:45:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:44,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 11:45:44,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1305, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 11:45:44,204 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 39 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:45:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:45,220 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2025-03-17 11:45:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-17 11:45:45,221 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 39 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) Word has length 50 [2025-03-17 11:45:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:45,221 INFO L225 Difference]: With dead ends: 207 [2025-03-17 11:45:45,221 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 11:45:45,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=770, Invalid=3786, Unknown=0, NotChecked=0, Total=4556 [2025-03-17 11:45:45,222 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 120 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:45,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 244 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:45:45,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 11:45:45,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 164. [2025-03-17 11:45:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.116564417177914) internal successors, (182), 163 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 182 transitions. [2025-03-17 11:45:45,224 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 182 transitions. Word has length 50 [2025-03-17 11:45:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:45,224 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 182 transitions. [2025-03-17 11:45:45,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 39 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:45:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 182 transitions. [2025-03-17 11:45:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 11:45:45,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:45,225 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:45,231 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:45:45,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:45,426 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-17 11:45:45,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash -555971028, now seen corresponding path program 9 times [2025-03-17 11:45:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:45,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642504750] [2025-03-17 11:45:45,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:45,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 7 equivalence classes. [2025-03-17 11:45:45,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 49 of 55 statements. [2025-03-17 11:45:45,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 11:45:45,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 10 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 11:45:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642504750] [2025-03-17 11:45:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642504750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984231113] [2025-03-17 11:45:46,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:46,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:46,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:46,478 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:45:46,479 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:45:46,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 7 equivalence classes. [2025-03-17 11:45:46,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 49 of 55 statements. [2025-03-17 11:45:46,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 11:45:46,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:46,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-17 11:45:46,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:46,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:46:00,217 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2025-03-17 11:46:00,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 39 [2025-03-17 11:46:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 13 proven. 25 refuted. 8 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 11:46:00,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:00,993 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 59 treesize of output 51 [2025-03-17 11:46:00,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-03-17 11:46:01,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 23 treesize of output 19 [2025-03-17 11:46:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 11:46:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984231113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:01,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:01,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 62 [2025-03-17 11:46:01,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997312503] [2025-03-17 11:46:01,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:01,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-17 11:46:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:01,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-17 11:46:01,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=3629, Unknown=11, NotChecked=0, Total=3906 [2025-03-17 11:46:01,525 INFO L87 Difference]: Start difference. First operand 164 states and 182 transitions. Second operand has 63 states, 62 states have (on average 1.935483870967742) internal successors, (120), 63 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:06,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:46:11,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:46:16,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:46:36,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]