./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f22afdea3888c472e42c0b4bee511704d4ceb9c1e2d9f4db0ce5ffbd6de758f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:27:38,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:27:38,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:27:38,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:27:38,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:27:38,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:27:38,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:27:38,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:27:38,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:27:38,506 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:27:38,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:27:38,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:27:38,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:27:38,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:27:38,506 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:27:38,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:27:38,506 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:27:38,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:27:38,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:27:38,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:27:38,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:27:38,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:27:38,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:27:38,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:27:38,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:27:38,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:27:38,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:27:38,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:27:38,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:27:38,508 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 -> f22afdea3888c472e42c0b4bee511704d4ceb9c1e2d9f4db0ce5ffbd6de758f0 [2025-03-04 07:27:38,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:27:38,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:27:38,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:27:38,769 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:27:38,769 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:27:38,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2025-03-04 07:27:40,059 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a92eb6d/d7fa3f9933314f7a8411aac36bde941b/FLAG834bbd4ec [2025-03-04 07:27:40,353 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:27:40,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2025-03-04 07:27:40,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a92eb6d/d7fa3f9933314f7a8411aac36bde941b/FLAG834bbd4ec [2025-03-04 07:27:40,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a92eb6d/d7fa3f9933314f7a8411aac36bde941b [2025-03-04 07:27:40,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:27:40,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:27:40,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:27:40,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:27:40,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:27:40,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@937d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40, skipping insertion in model container [2025-03-04 07:27:40,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:27:40,815 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-04 07:27:40,816 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-04 07:27:40,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:27:40,825 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:27:40,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:27:40,867 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:27:40,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40 WrapperNode [2025-03-04 07:27:40,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:27:40,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:27:40,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:27:40,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:27:40,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,892 INFO L138 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-03-04 07:27:40,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:27:40,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:27:40,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:27:40,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:27:40,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,909 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [1, 3]. 75 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2]. [2025-03-04 07:27:40,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:27:40,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:27:40,917 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:27:40,917 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:27:40,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (1/1) ... [2025-03-04 07:27:40,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:27:40,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:40,938 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-04 07:27:40,941 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-04 07:27:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:27:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:27:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:27:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:27:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:27:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:27:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:27:40,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:27:41,026 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:27:41,028 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:27:41,126 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; [2025-03-04 07:27:41,134 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-04 07:27:41,134 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:27:41,140 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:27:41,140 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:27:41,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:27:41 BoogieIcfgContainer [2025-03-04 07:27:41,140 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:27:41,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:27:41,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:27:41,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:27:41,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:27:40" (1/3) ... [2025-03-04 07:27:41,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c917ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:27:41, skipping insertion in model container [2025-03-04 07:27:41,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:40" (2/3) ... [2025-03-04 07:27:41,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c917ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:27:41, skipping insertion in model container [2025-03-04 07:27:41,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:27:41" (3/3) ... [2025-03-04 07:27:41,149 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca-1.i [2025-03-04 07:27:41,159 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:27:41,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstpcpy-alloca-1.i that has 1 procedures, 27 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-03-04 07:27:41,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:27:41,201 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;@30dcfd4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:27:41,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 07:27:41,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:27:41,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:41,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:27:41,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:41,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2010657025, now seen corresponding path program 1 times [2025-03-04 07:27:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531505056] [2025-03-04 07:27:41,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:41,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:27:41,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:27:41,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:41,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:41,347 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-04 07:27:41,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:41,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531505056] [2025-03-04 07:27:41,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531505056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:41,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:41,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263072219] [2025-03-04 07:27:41,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:41,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:27:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:41,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:27:41,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:41,369 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:41,414 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-04 07:27:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:41,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:27:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:41,421 INFO L225 Difference]: With dead ends: 28 [2025-03-04 07:27:41,421 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 07:27:41,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:41,426 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:41,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 07:27:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 07:27:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 25 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-04 07:27:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-04 07:27:41,450 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 6 [2025-03-04 07:27:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:41,451 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-04 07:27:41,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-04 07:27:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:27:41,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:41,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:27:41,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:27:41,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:41,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2010657986, now seen corresponding path program 1 times [2025-03-04 07:27:41,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:41,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146297115] [2025-03-04 07:27:41,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:41,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:27:41,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:27:41,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:41,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:41,484 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-04 07:27:41,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:41,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146297115] [2025-03-04 07:27:41,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146297115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:41,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:41,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:27:41,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069155273] [2025-03-04 07:27:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:41,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:27:41,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:41,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:27:41,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:27:41,486 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:41,502 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-04 07:27:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:27:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:27:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:41,504 INFO L225 Difference]: With dead ends: 27 [2025-03-04 07:27:41,504 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 07:27:41,505 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-04 07:27:41,505 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 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-04 07:27:41,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 07:27:41,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-03-04 07:27:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.75) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-04 07:27:41,508 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 6 [2025-03-04 07:27:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:41,508 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-04 07:27:41,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-04 07:27:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:27:41,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:41,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:41,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:27:41,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:41,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2094139072, now seen corresponding path program 1 times [2025-03-04 07:27:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:41,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571209110] [2025-03-04 07:27:41,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:41,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:27:41,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:27:41,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:41,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:41,589 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-04 07:27:41,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:41,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571209110] [2025-03-04 07:27:41,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571209110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:41,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698315529] [2025-03-04 07:27:41,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:41,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:27:41,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:41,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:27:41,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:41,591 INFO L87 Difference]: Start difference. First operand 25 states and 28 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-04 07:27:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:41,619 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-03-04 07:27:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:41,620 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-04 07:27:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:41,620 INFO L225 Difference]: With dead ends: 29 [2025-03-04 07:27:41,620 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 07:27:41,620 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-04 07:27:41,621 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:41,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 07:27:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2025-03-04 07:27:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-04 07:27:41,624 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2025-03-04 07:27:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:41,624 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-04 07:27:41,625 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-04 07:27:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-04 07:27:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:27:41,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:41,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:41,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:27:41,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:41,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:41,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2094138912, now seen corresponding path program 1 times [2025-03-04 07:27:41,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:41,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053219781] [2025-03-04 07:27:41,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:41,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:41,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:27:41,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:27:41,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:41,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:41,877 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-04 07:27:41,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053219781] [2025-03-04 07:27:41,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053219781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:41,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:41,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538948316] [2025-03-04 07:27:41,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:41,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:27:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:41,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:27:41,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:41,879 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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-04 07:27:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:41,935 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-04 07:27:41,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:27:41,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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-04 07:27:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:41,936 INFO L225 Difference]: With dead ends: 31 [2025-03-04 07:27:41,936 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 07:27:41,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:27:41,937 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:41,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 43 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 07:27:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2025-03-04 07:27:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-04 07:27:41,939 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2025-03-04 07:27:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:41,940 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-04 07:27:41,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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-04 07:27:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-04 07:27:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:27:41,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:41,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:41,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:27:41,941 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:41,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2094138911, now seen corresponding path program 1 times [2025-03-04 07:27:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:41,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542335663] [2025-03-04 07:27:41,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:41,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:27:41,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:27:41,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:41,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:42,108 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-04 07:27:42,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542335663] [2025-03-04 07:27:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542335663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:42,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:42,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:42,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325720735] [2025-03-04 07:27:42,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:42,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:27:42,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:42,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:27:42,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:42,111 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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-04 07:27:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:42,189 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-03-04 07:27:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:42,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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-04 07:27:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:42,190 INFO L225 Difference]: With dead ends: 33 [2025-03-04 07:27:42,191 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 07:27:42,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:27:42,192 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:42,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 07:27:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2025-03-04 07:27:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.5) internal successors, (30), 26 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-04 07:27:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-04 07:27:42,197 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 7 [2025-03-04 07:27:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:42,197 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-04 07:27:42,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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-04 07:27:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-04 07:27:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:27:42,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:42,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:42,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:27:42,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:42,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2094109120, now seen corresponding path program 1 times [2025-03-04 07:27:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134570000] [2025-03-04 07:27:42,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:42,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:27:42,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:27:42,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:42,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:42,350 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-04 07:27:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134570000] [2025-03-04 07:27:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134570000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:42,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:27:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059911995] [2025-03-04 07:27:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:42,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:27:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:42,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:27:42,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:27:42,355 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-04 07:27:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:42,403 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-04 07:27:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:27:42,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-04 07:27:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:42,404 INFO L225 Difference]: With dead ends: 29 [2025-03-04 07:27:42,405 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 07:27:42,405 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-04 07:27:42,406 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:42,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 07:27:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-03-04 07:27:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-04 07:27:42,412 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2025-03-04 07:27:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:42,412 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-04 07:27:42,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-04 07:27:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-04 07:27:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:27:42,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:42,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:42,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:27:42,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:42,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2092359977, now seen corresponding path program 1 times [2025-03-04 07:27:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:42,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330521979] [2025-03-04 07:27:42,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:42,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:27:42,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:27:42,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:42,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:42,534 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-04 07:27:42,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330521979] [2025-03-04 07:27:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330521979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005772333] [2025-03-04 07:27:42,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:42,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:42,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:42,541 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-04 07:27:42,543 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-04 07:27:42,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:27:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:27:42,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:42,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:42,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:27:42,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:42,654 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-04 07:27:42,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:42,716 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-04 07:27:42,804 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-04 07:27:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005772333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:42,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:42,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-04 07:27:42,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490182713] [2025-03-04 07:27:42,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:42,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:27:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:42,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:27:42,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:27:42,806 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:42,911 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-04 07:27:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:27:42,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:27:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:42,912 INFO L225 Difference]: With dead ends: 32 [2025-03-04 07:27:42,912 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 07:27:42,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:27:42,912 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:42,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 07:27:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-04 07:27:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-04 07:27:42,915 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 10 [2025-03-04 07:27:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:42,915 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-04 07:27:42,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-04 07:27:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:27:42,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:42,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:42,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:27:43,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:43,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:43,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1204856296, now seen corresponding path program 1 times [2025-03-04 07:27:43,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:43,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9111333] [2025-03-04 07:27:43,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:43,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:43,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:27:43,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:27:43,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:43,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:43,223 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-04 07:27:43,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9111333] [2025-03-04 07:27:43,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9111333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547706759] [2025-03-04 07:27:43,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:43,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:43,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:43,225 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-04 07:27:43,227 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-04 07:27:43,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:27:43,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:27:43,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:43,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:27:43,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:43,324 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-04 07:27:43,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:43,351 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-04 07:27:43,418 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-04 07:27:43,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547706759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:43,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:43,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 07:27:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255088251] [2025-03-04 07:27:43,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:27:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:43,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:27:43,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:27:43,421 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:43,507 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-04 07:27:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:27:43,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:27:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:43,508 INFO L225 Difference]: With dead ends: 40 [2025-03-04 07:27:43,509 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 07:27:43,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:27:43,509 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:43,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 07:27:43,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2025-03-04 07:27:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.48) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-04 07:27:43,511 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 10 [2025-03-04 07:27:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:43,511 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-04 07:27:43,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-04 07:27:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:27:43,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:43,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:43,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:27:43,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 07:27:43,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:43,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:43,714 INFO L85 PathProgramCache]: Analyzing trace with hash 537954039, now seen corresponding path program 1 times [2025-03-04 07:27:43,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:43,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033931853] [2025-03-04 07:27:43,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:43,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:43,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:27:43,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:27:43,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:43,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:43,801 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-04 07:27:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033931853] [2025-03-04 07:27:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033931853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:27:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218669355] [2025-03-04 07:27:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:43,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:27:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:43,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:27:43,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:27:43,804 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:43,826 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-04 07:27:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:27:43,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:27:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:43,828 INFO L225 Difference]: With dead ends: 31 [2025-03-04 07:27:43,828 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 07:27:43,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:27:43,829 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:43,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 07:27:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-04 07:27:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-04 07:27:43,830 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2025-03-04 07:27:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:43,830 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-04 07:27:43,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-03-04 07:27:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:27:43,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:43,831 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:43,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:27:43,831 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:43,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash 537954199, now seen corresponding path program 1 times [2025-03-04 07:27:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:43,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254825120] [2025-03-04 07:27:43,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:43,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:43,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:27:43,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:27:43,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:43,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:44,003 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-04 07:27:44,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:44,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254825120] [2025-03-04 07:27:44,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254825120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:44,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100282352] [2025-03-04 07:27:44,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:44,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:44,006 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-04 07:27:44,008 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-04 07:27:44,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:27:44,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:27:44,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:44,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:44,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:27:44,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:44,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-04 07:27:44,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:27:44,202 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-04 07:27:44,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:44,324 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-04 07:27:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100282352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:44,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 07:27:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000654569] [2025-03-04 07:27:44,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:44,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:27:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:44,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:27:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:27:44,326 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:44,427 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-03-04 07:27:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:27:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 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-04 07:27:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:44,429 INFO L225 Difference]: With dead ends: 32 [2025-03-04 07:27:44,429 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 07:27:44,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:27:44,430 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:44,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 66 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 07:27:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2025-03-04 07:27:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 07:27:44,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2025-03-04 07:27:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:44,433 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 07:27:44,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 07:27:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:27:44,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:44,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:44,440 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-04 07:27:44,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:44,635 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash -713244717, now seen corresponding path program 1 times [2025-03-04 07:27:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257270862] [2025-03-04 07:27:44,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:44,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:27:44,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:27:44,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:44,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:44,717 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-04 07:27:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257270862] [2025-03-04 07:27:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257270862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033597161] [2025-03-04 07:27:44,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:44,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:44,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:44,719 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-04 07:27:44,730 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-04 07:27:44,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:27:44,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:27:44,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:44,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:44,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:27:44,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:44,814 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-04 07:27:44,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:44,833 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-04 07:27:44,843 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-04 07:27:44,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033597161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:44,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:44,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-03-04 07:27:44,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981577037] [2025-03-04 07:27:44,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:44,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:27:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:44,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:27:44,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:27:44,844 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:44,900 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-04 07:27:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:27:44,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:27:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:44,901 INFO L225 Difference]: With dead ends: 31 [2025-03-04 07:27:44,901 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 07:27:44,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:27:44,901 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:44,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 07:27:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2025-03-04 07:27:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-04 07:27:44,903 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2025-03-04 07:27:44,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:44,903 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-04 07:27:44,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-04 07:27:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:27:44,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:44,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:44,908 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-04 07:27:45,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:45,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:45,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash -713244718, now seen corresponding path program 1 times [2025-03-04 07:27:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:45,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693348996] [2025-03-04 07:27:45,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:45,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:27:45,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:27:45,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:45,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:45,144 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-04 07:27:45,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:45,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693348996] [2025-03-04 07:27:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693348996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:45,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:45,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:27:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656166223] [2025-03-04 07:27:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:45,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:27:45,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:45,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:27:45,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:45,146 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-04 07:27:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:45,176 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-03-04 07:27:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:45,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-04 07:27:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:45,177 INFO L225 Difference]: With dead ends: 22 [2025-03-04 07:27:45,177 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 07:27:45,177 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-04 07:27:45,178 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:45,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 28 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 07:27:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-04 07:27:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 07:27:45,180 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2025-03-04 07:27:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:45,180 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 07:27:45,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-04 07:27:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 07:27:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:27:45,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:45,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:45,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:27:45,181 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash -635749797, now seen corresponding path program 1 times [2025-03-04 07:27:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309229327] [2025-03-04 07:27:45,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:45,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:27:45,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:27:45,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:45,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:45,297 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-04 07:27:45,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:45,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309229327] [2025-03-04 07:27:45,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309229327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:45,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:45,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127473808] [2025-03-04 07:27:45,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:45,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:27:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:45,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:27:45,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:45,299 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:45,333 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2025-03-04 07:27:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:45,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:27:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:45,334 INFO L225 Difference]: With dead ends: 21 [2025-03-04 07:27:45,334 INFO L226 Difference]: Without dead ends: 21 [2025-03-04 07:27:45,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:45,335 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:45,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-04 07:27:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-04 07:27:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 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-04 07:27:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-04 07:27:45,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2025-03-04 07:27:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:45,337 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-04 07:27:45,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-04 07:27:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:27:45,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:45,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:45,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:27:45,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:45,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash -635749796, now seen corresponding path program 1 times [2025-03-04 07:27:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789166769] [2025-03-04 07:27:45,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:45,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:27:45,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:27:45,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:45,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:45,635 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-04 07:27:45,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:45,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789166769] [2025-03-04 07:27:45,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789166769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:45,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:45,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:27:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101953097] [2025-03-04 07:27:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:45,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:27:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:45,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:27:45,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:27:45,636 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:45,683 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-03-04 07:27:45,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:27:45,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:27:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:45,684 INFO L225 Difference]: With dead ends: 33 [2025-03-04 07:27:45,684 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 07:27:45,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:27:45,684 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:45,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 07:27:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-04 07:27:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-04 07:27:45,686 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2025-03-04 07:27:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:45,686 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-04 07:27:45,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-04 07:27:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:27:45,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:45,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:45,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:27:45,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:45,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1862266141, now seen corresponding path program 1 times [2025-03-04 07:27:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:45,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346698264] [2025-03-04 07:27:45,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:45,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:27:45,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:27:45,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:45,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:45,818 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-04 07:27:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:45,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346698264] [2025-03-04 07:27:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346698264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:45,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:45,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:27:45,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714745394] [2025-03-04 07:27:45,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:45,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:27:45,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:45,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:27:45,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:27:45,820 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:45,852 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-04 07:27:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:27:45,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:27:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:45,852 INFO L225 Difference]: With dead ends: 34 [2025-03-04 07:27:45,853 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 07:27:45,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:27:45,854 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:45,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 07:27:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2025-03-04 07:27:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 07:27:45,855 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 13 [2025-03-04 07:27:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:45,855 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 07:27:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 07:27:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:27:45,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:45,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:45,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:27:45,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:45,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1070199520, now seen corresponding path program 1 times [2025-03-04 07:27:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:45,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360324950] [2025-03-04 07:27:45,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:45,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:27:45,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:27:45,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:45,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:45,968 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-04 07:27:45,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:45,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360324950] [2025-03-04 07:27:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360324950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:45,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:27:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681026530] [2025-03-04 07:27:45,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:45,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:27:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:45,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:27:45,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:27:45,969 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:46,004 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-04 07:27:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:27:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:27:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:46,005 INFO L225 Difference]: With dead ends: 34 [2025-03-04 07:27:46,005 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 07:27:46,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:27:46,006 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:46,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 07:27:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-04 07:27:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-04 07:27:46,009 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 15 [2025-03-04 07:27:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:46,009 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-04 07:27:46,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-04 07:27:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:27:46,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:46,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:46,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:27:46,010 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:46,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash -941116801, now seen corresponding path program 1 times [2025-03-04 07:27:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:46,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273460411] [2025-03-04 07:27:46,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:46,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:46,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:27:46,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:27:46,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:46,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:46,172 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-04 07:27:46,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:46,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273460411] [2025-03-04 07:27:46,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273460411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:46,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:46,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:27:46,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683615827] [2025-03-04 07:27:46,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:46,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:27:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:46,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:27:46,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:27:46,174 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:46,230 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2025-03-04 07:27:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:27:46,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:27:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:46,231 INFO L225 Difference]: With dead ends: 55 [2025-03-04 07:27:46,231 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 07:27:46,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:27:46,232 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:46,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 07:27:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2025-03-04 07:27:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 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-04 07:27:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-04 07:27:46,234 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 15 [2025-03-04 07:27:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:46,234 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-04 07:27:46,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-04 07:27:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:27:46,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:46,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:46,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:27:46,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:46,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1234519808, now seen corresponding path program 1 times [2025-03-04 07:27:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:46,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530283232] [2025-03-04 07:27:46,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:46,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:46,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:27:46,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:27:46,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:46,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:46,427 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-04 07:27:46,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530283232] [2025-03-04 07:27:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530283232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668154610] [2025-03-04 07:27:46,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:46,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:46,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:46,467 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-04 07:27:46,474 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-04 07:27:46,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:27:46,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:27:46,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:46,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:46,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:27:46,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:46,595 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-04 07:27:46,652 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-04 07:27:46,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:46,679 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-04 07:27:46,683 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-04 07:27:46,826 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-04 07:27:46,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668154610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:46,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:46,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-03-04 07:27:46,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412054248] [2025-03-04 07:27:46,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:46,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:27:46,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:46,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:27:46,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:27:46,829 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-04 07:27:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:47,003 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2025-03-04 07:27:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:27:47,004 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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 15 [2025-03-04 07:27:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:47,004 INFO L225 Difference]: With dead ends: 56 [2025-03-04 07:27:47,004 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 07:27:47,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:27:47,005 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:47,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 128 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 07:27:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2025-03-04 07:27:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 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-04 07:27:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-04 07:27:47,009 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 15 [2025-03-04 07:27:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:47,009 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-04 07:27:47,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-04 07:27:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-04 07:27:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:27:47,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:47,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:47,018 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-04 07:27:47,214 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,SelfDestructingSolverStorable17 [2025-03-04 07:27:47,214 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:47,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1964594252, now seen corresponding path program 1 times [2025-03-04 07:27:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:47,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841304101] [2025-03-04 07:27:47,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:47,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:27:47,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:27:47,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:47,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:47,330 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-04 07:27:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841304101] [2025-03-04 07:27:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841304101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:27:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532952764] [2025-03-04 07:27:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:47,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:27:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:47,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:27:47,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:47,331 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-04 07:27:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:47,349 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-03-04 07:27:47,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:47,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-04 07:27:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:47,350 INFO L225 Difference]: With dead ends: 35 [2025-03-04 07:27:47,350 INFO L226 Difference]: Without dead ends: 21 [2025-03-04 07:27:47,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-04 07:27:47,350 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 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-04 07:27:47,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-04 07:27:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-04 07:27:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-04 07:27:47,352 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2025-03-04 07:27:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:47,352 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-04 07:27:47,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-04 07:27:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-04 07:27:47,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:27:47,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:47,354 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:47,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:27:47,354 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:47,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1961002198, now seen corresponding path program 2 times [2025-03-04 07:27:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:47,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128892656] [2025-03-04 07:27:47,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:47,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 07:27:47,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:27:47,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:47,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:47,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128892656] [2025-03-04 07:27:47,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128892656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922309866] [2025-03-04 07:27:47,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:47,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:47,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:47,581 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-04 07:27:47,582 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-04 07:27:47,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 07:27:47,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:27:47,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:47,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:47,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:27:47,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:47,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:47,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-04 07:27:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922309866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:47,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:47,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-04 07:27:47,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538603309] [2025-03-04 07:27:47,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:47,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:27:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:47,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:27:47,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:27:47,876 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:48,001 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-03-04 07:27:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:27:48,002 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 07:27:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:48,002 INFO L225 Difference]: With dead ends: 27 [2025-03-04 07:27:48,002 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 07:27:48,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:27:48,003 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:48,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 07:27:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-03-04 07:27:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 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-04 07:27:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-04 07:27:48,004 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2025-03-04 07:27:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:48,004 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-04 07:27:48,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-04 07:27:48,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:27:48,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:48,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:48,013 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-04 07:27:48,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:48,205 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:48,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash 661525945, now seen corresponding path program 1 times [2025-03-04 07:27:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:48,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101724633] [2025-03-04 07:27:48,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:48,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:27:48,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:27:48,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:48,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:48,474 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-04 07:27:48,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101724633] [2025-03-04 07:27:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101724633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053356407] [2025-03-04 07:27:48,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:48,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:48,478 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-04 07:27:48,480 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-04 07:27:48,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:27:48,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:27:48,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:48,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:48,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 07:27:48,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:48,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:27:48,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:27:48,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:27:48,894 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-04 07:27:48,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:49,110 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:27:49,145 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-04 07:27:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053356407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:49,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:49,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 25 [2025-03-04 07:27:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538214198] [2025-03-04 07:27:49,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:49,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:27:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:49,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:27:49,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:27:49,147 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 26 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-04 07:27:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:49,373 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-04 07:27:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:27:49,373 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:27:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:49,374 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:27:49,374 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:27:49,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:27:49,374 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:49,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 31 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:27:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2025-03-04 07:27:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-03-04 07:27:49,376 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2025-03-04 07:27:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:49,376 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-04 07:27:49,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 26 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-04 07:27:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-03-04 07:27:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:27:49,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:49,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:49,385 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-04 07:27:49,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:49,578 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:49,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash 71271741, now seen corresponding path program 3 times [2025-03-04 07:27:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773458161] [2025-03-04 07:27:49,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:49,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 07:27:49,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:27:49,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:27:49,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:49,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:49,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773458161] [2025-03-04 07:27:49,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773458161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:49,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628500209] [2025-03-04 07:27:49,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:49,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:49,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:49,842 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-04 07:27:49,842 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-04 07:27:49,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 07:27:49,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:27:49,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:27:49,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:49,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:27:49,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:49,964 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-04 07:27:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:50,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:50,014 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-04 07:27:50,016 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-04 07:27:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:50,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628500209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:50,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:50,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2025-03-04 07:27:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106897807] [2025-03-04 07:27:50,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:50,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:27:50,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:50,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:27:50,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:27:50,059 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:50,248 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-04 07:27:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:27:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:27:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:50,249 INFO L225 Difference]: With dead ends: 37 [2025-03-04 07:27:50,249 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 07:27:50,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:27:50,251 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:50,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 07:27:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-04 07:27:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-03-04 07:27:50,253 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2025-03-04 07:27:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:50,253 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-03-04 07:27:50,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-03-04 07:27:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:27:50,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:50,253 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:50,259 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-04 07:27:50,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 07:27:50,454 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:50,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1763141485, now seen corresponding path program 4 times [2025-03-04 07:27:50,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:50,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607040436] [2025-03-04 07:27:50,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:50,463 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 07:27:50,470 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 24 statements. [2025-03-04 07:27:50,470 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:27:50,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:50,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:50,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607040436] [2025-03-04 07:27:50,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607040436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:50,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236283511] [2025-03-04 07:27:50,816 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:50,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:50,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:50,818 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-04 07:27:50,819 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-04 07:27:50,865 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 07:27:50,878 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 24 statements. [2025-03-04 07:27:50,878 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:27:50,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:50,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 07:27:50,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:50,937 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-04 07:27:51,137 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-04 07:27:51,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 29 [2025-03-04 07:27:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:27:51,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:51,385 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-04 07:27:51,388 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-04 07:27:51,537 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-04 07:27:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:27:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236283511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:51,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:51,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2025-03-04 07:27:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606690065] [2025-03-04 07:27:51,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:51,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:27:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:51,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:27:51,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:27:51,546 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 31 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-04 07:27:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:51,855 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-03-04 07:27:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:27:51,855 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:27:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:51,856 INFO L225 Difference]: With dead ends: 27 [2025-03-04 07:27:51,856 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 07:27:51,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:27:51,856 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:51,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 69 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 07:27:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-03-04 07:27:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-04 07:27:51,860 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2025-03-04 07:27:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:51,860 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-04 07:27:51,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 31 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-04 07:27:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-04 07:27:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:27:51,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:51,860 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:51,868 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-04 07:27:52,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:52,061 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:52,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1177188764, now seen corresponding path program 2 times [2025-03-04 07:27:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701740907] [2025-03-04 07:27:52,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:52,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 07:27:52,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:27:52,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:52,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:52,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:52,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701740907] [2025-03-04 07:27:52,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701740907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:52,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459679019] [2025-03-04 07:27:52,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:52,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:52,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:52,298 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-04 07:27:52,299 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-04 07:27:52,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 07:27:52,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:27:52,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:52,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:27:52,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:52,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:27:52,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:27:52,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:27:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:52,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:52,815 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:27:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459679019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:52,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:52,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2025-03-04 07:27:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455549897] [2025-03-04 07:27:52,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:52,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 07:27:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:52,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 07:27:52,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:27:52,850 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 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-04 07:27:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:53,030 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2025-03-04 07:27:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:27:53,030 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 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) Word has length 25 [2025-03-04 07:27:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:53,030 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:27:53,030 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:27:53,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:27:53,032 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:53,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:27:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-04 07:27:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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-04 07:27:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-03-04 07:27:53,034 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2025-03-04 07:27:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:53,034 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-03-04 07:27:53,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 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-04 07:27:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-03-04 07:27:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:27:53,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:53,035 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:53,043 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-04 07:27:53,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:27:53,242 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:53,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1222446959, now seen corresponding path program 3 times [2025-03-04 07:27:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368770421] [2025-03-04 07:27:53,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:53,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-03-04 07:27:53,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:27:53,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 07:27:53,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:53,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368770421] [2025-03-04 07:27:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368770421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942977056] [2025-03-04 07:27:53,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:53,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:53,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:53,514 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-04 07:27:53,515 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-04 07:27:53,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-03-04 07:27:53,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:27:53,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 07:27:53,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:53,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 07:27:53,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:53,682 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-04 07:27:53,727 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-04 07:27:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:53,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:53,748 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-04 07:27:53,749 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-04 07:27:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942977056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:53,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-03-04 07:27:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503773742] [2025-03-04 07:27:53,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:53,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:27:53,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:53,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:27:53,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:27:53,805 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 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-04 07:27:54,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:54,149 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2025-03-04 07:27:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:27:54,150 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 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 28 [2025-03-04 07:27:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:54,150 INFO L225 Difference]: With dead ends: 45 [2025-03-04 07:27:54,150 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 07:27:54,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=1307, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:27:54,151 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:54,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 07:27:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-04 07:27:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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-04 07:27:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-03-04 07:27:54,152 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2025-03-04 07:27:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:54,152 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-03-04 07:27:54,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 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-04 07:27:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-03-04 07:27:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:27:54,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:54,153 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:54,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:27:54,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 07:27:54,353 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:54,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:54,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1307725991, now seen corresponding path program 4 times [2025-03-04 07:27:54,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:54,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090735789] [2025-03-04 07:27:54,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:54,363 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 07:27:54,373 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:27:54,373 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:27:54,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:54,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:54,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090735789] [2025-03-04 07:27:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090735789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:54,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491891855] [2025-03-04 07:27:54,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:54,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:54,964 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-04 07:27:54,965 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-04 07:27:55,012 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 07:27:55,040 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:27:55,040 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:27:55,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:55,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 07:27:55,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:55,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:27:55,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:27:55,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:27:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:55,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:55,947 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:27:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:55,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491891855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:55,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:55,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 12] total 36 [2025-03-04 07:27:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088226791] [2025-03-04 07:27:55,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:55,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 07:27:55,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:55,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 07:27:55,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:27:55,998 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:56,455 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2025-03-04 07:27:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:27:56,456 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 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-04 07:27:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:56,456 INFO L225 Difference]: With dead ends: 36 [2025-03-04 07:27:56,456 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 07:27:56,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=1764, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 07:27:56,457 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:56,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 48 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 07:27:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-03-04 07:27:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-04 07:27:56,458 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2025-03-04 07:27:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:56,458 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-04 07:27:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-04 07:27:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:27:56,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:56,459 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:56,465 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-04 07:27:56,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 07:27:56,659 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:56,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1183294610, now seen corresponding path program 5 times [2025-03-04 07:27:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:56,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429153297] [2025-03-04 07:27:56,660 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:27:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:56,670 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 5 equivalence classes. [2025-03-04 07:27:56,679 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:27:56,679 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 07:27:56,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429153297] [2025-03-04 07:27:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429153297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285075181] [2025-03-04 07:27:56,999 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:27:56,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:56,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:57,001 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-04 07:27:57,002 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-04 07:27:57,053 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 5 equivalence classes. [2025-03-04 07:27:57,089 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:27:57,089 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 07:27:57,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:57,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 07:27:57,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:57,205 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-04 07:27:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:57,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:57,334 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-04 07:27:57,335 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-04 07:27:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:57,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285075181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:57,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:57,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 31 [2025-03-04 07:27:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182665328] [2025-03-04 07:27:57,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:57,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:27:57,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:57,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:27:57,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:27:57,409 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:57,879 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2025-03-04 07:27:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:27:57,879 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-04 07:27:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:57,879 INFO L225 Difference]: With dead ends: 54 [2025-03-04 07:27:57,879 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 07:27:57,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=2052, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 07:27:57,880 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:57,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 86 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 07:27:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-04 07:27:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-03-04 07:27:57,881 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 34 [2025-03-04 07:27:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:57,882 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-03-04 07:27:57,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2025-03-04 07:27:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:27:57,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:57,882 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:57,888 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-04 07:27:58,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:27:58,085 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:27:58,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1693920508, now seen corresponding path program 6 times [2025-03-04 07:27:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:58,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905136804] [2025-03-04 07:27:58,085 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:27:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:58,092 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 6 equivalence classes. [2025-03-04 07:27:58,105 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:27:58,106 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 07:27:58,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 15 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:58,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:58,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905136804] [2025-03-04 07:27:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905136804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:58,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287429246] [2025-03-04 07:27:58,591 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:27:58,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:58,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:58,593 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-04 07:27:58,595 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-04 07:27:58,647 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 6 equivalence classes. [2025-03-04 07:27:58,747 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:27:58,747 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 07:27:58,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:58,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-04 07:27:58,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:58,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:27:58,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:27:58,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 1 [2025-03-04 07:27:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:59,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:00,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287429246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:00,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:00,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 48 [2025-03-04 07:28:00,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821300151] [2025-03-04 07:28:00,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:00,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 07:28:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:00,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 07:28:00,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2072, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 07:28:00,399 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 49 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 49 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:01,365 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2025-03-04 07:28:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:28:01,365 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 49 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-04 07:28:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:01,366 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:28:01,366 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:28:01,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=488, Invalid=3544, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 07:28:01,367 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:01,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 50 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:28:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:28:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2025-03-04 07:28:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 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-04 07:28:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2025-03-04 07:28:01,370 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2025-03-04 07:28:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:01,370 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2025-03-04 07:28:01,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 49 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2025-03-04 07:28:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:28:01,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:01,371 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:01,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:28:01,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:01,571 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:28:01,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2015043599, now seen corresponding path program 7 times [2025-03-04 07:28:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:01,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711340295] [2025-03-04 07:28:01,572 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:28:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:01,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:28:01,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:28:01,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:01,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711340295] [2025-03-04 07:28:01,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711340295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643690410] [2025-03-04 07:28:01,959 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:28:01,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:01,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:01,964 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-04 07:28:01,967 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-04 07:28:02,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:28:02,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:28:02,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:02,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:02,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 07:28:02,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:02,182 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-04 07:28:02,317 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-04 07:28:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:02,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:02,359 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-04 07:28:02,361 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-04 07:28:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:02,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643690410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:02,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:02,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 07:28:02,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095054894] [2025-03-04 07:28:02,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:02,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:28:02,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:02,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:28:02,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:28:02,433 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 34 states, 34 states have (on average 2.323529411764706) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:02,977 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2025-03-04 07:28:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:28:02,978 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.323529411764706) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-04 07:28:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:02,978 INFO L225 Difference]: With dead ends: 63 [2025-03-04 07:28:02,978 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 07:28:02,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=2431, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 07:28:02,979 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:02,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:28:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 07:28:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-03-04 07:28:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2025-03-04 07:28:02,980 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 40 [2025-03-04 07:28:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:02,980 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2025-03-04 07:28:02,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.323529411764706) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2025-03-04 07:28:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:28:02,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:02,980 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:02,994 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-04 07:28:03,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 07:28:03,189 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:28:03,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -31903495, now seen corresponding path program 8 times [2025-03-04 07:28:03,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:03,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654989248] [2025-03-04 07:28:03,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:03,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 07:28:03,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:28:03,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:03,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:03,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:03,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654989248] [2025-03-04 07:28:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654989248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:03,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59992912] [2025-03-04 07:28:03,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:03,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:03,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:03,551 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-04 07:28:03,551 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-04 07:28:03,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 07:28:03,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:28:03,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:03,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:03,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-04 07:28:03,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:03,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:28:03,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:28:03,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:28:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 35 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:04,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:04,715 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:28:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 51 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:04,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59992912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:04,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:04,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 45 [2025-03-04 07:28:04,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042529671] [2025-03-04 07:28:04,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:04,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 07:28:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:04,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 07:28:04,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1806, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 07:28:04,750 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:05,006 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2025-03-04 07:28:05,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:28:05,007 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-04 07:28:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:05,007 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:28:05,007 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:28:05,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=1965, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 07:28:05,008 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:05,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:28:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:28:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-03-04 07:28:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 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-04 07:28:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2025-03-04 07:28:05,010 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2025-03-04 07:28:05,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:05,010 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2025-03-04 07:28:05,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2025-03-04 07:28:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:28:05,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:05,010 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:05,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:28:05,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:05,211 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:28:05,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1249296654, now seen corresponding path program 9 times [2025-03-04 07:28:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:05,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161120038] [2025-03-04 07:28:05,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:05,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 7 equivalence classes. [2025-03-04 07:28:05,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:28:05,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 07:28:05,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 25 proven. 31 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 07:28:05,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161120038] [2025-03-04 07:28:05,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161120038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302153853] [2025-03-04 07:28:05,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:05,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:05,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:05,580 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-04 07:28:05,582 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-04 07:28:05,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 7 equivalence classes. [2025-03-04 07:28:05,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:28:05,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 07:28:05,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:05,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 07:28:05,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:05,974 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-04 07:28:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:06,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:06,250 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-04 07:28:06,251 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-04 07:28:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302153853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:06,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19] total 45 [2025-03-04 07:28:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568061014] [2025-03-04 07:28:06,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:06,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 07:28:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:06,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 07:28:06,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1859, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 07:28:06,516 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 45 states, 45 states have (on average 2.422222222222222) internal successors, (109), 45 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:07,366 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2025-03-04 07:28:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 07:28:07,367 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.422222222222222) internal successors, (109), 45 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-04 07:28:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:07,367 INFO L225 Difference]: With dead ends: 71 [2025-03-04 07:28:07,367 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:28:07,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=371, Invalid=4885, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 07:28:07,368 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:07,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:28:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:28:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:28:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:28:07,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2025-03-04 07:28:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:07,369 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:28:07,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.422222222222222) internal successors, (109), 45 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:28:07,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:28:07,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2025-03-04 07:28:07,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-03-04 07:28:07,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-03-04 07:28:07,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-03-04 07:28:07,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-03-04 07:28:07,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2025-03-04 07:28:07,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2025-03-04 07:28:07,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2025-03-04 07:28:07,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2025-03-04 07:28:07,379 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-04 07:28:07,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:07,574 INFO L422 BasicCegarLoop]: Path program histogram: [9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:07,579 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:28:07,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:28:07 BoogieIcfgContainer [2025-03-04 07:28:07,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:28:07,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:28:07,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:28:07,583 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:28:07,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:27:41" (3/4) ... [2025-03-04 07:28:07,585 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:28:07,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 07:28:07,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 07:28:07,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 07:28:07,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:28:07,643 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:28:07,643 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:28:07,643 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:28:07,644 INFO L158 Benchmark]: Toolchain (without parser) took 27006.53ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 122.3MB in the beginning and 320.3MB in the end (delta: -198.0MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2025-03-04 07:28:07,644 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:28:07,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.75ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 105.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:28:07,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.74ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 103.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:28:07,644 INFO L158 Benchmark]: Boogie Preprocessor took 22.66ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 102.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:28:07,644 INFO L158 Benchmark]: IcfgBuilder took 223.56ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 88.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:28:07,644 INFO L158 Benchmark]: TraceAbstraction took 26439.52ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 87.4MB in the beginning and 327.7MB in the end (delta: -240.2MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2025-03-04 07:28:07,645 INFO L158 Benchmark]: Witness Printer took 60.83ms. Allocated memory is still 453.0MB. Free memory was 327.7MB in the beginning and 320.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:28:07,645 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.75ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 105.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.74ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 103.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.66ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 102.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 223.56ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 88.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26439.52ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 87.4MB in the beginning and 327.7MB in the end (delta: -240.2MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * Witness Printer took 60.83ms. Allocated memory is still 453.0MB. Free memory was 327.7MB in the beginning and 320.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 518]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 31, TraceHistogramMax: 7, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 1781 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1400 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7086 IncrementalHoareTripleChecker+Invalid, 7209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 381 mSDtfsCounter, 7086 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1210 GetRequests, 593 SyntacticMatches, 6 SemanticMatches, 611 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5050 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=30, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 136 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 994 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 1352 ConstructedInterpolants, 6 QuantifiedInterpolants, 16733 SizeOfPredicates, 98 NumberOfNonLiveVariables, 2701 ConjunctsInSsa, 591 ConjunctsInUnsatCore, 65 InterpolantComputations, 14 PerfectInterpolantSequences, 431/1549 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:28:07,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE