./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-15/cstrcmp_mixed_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 577a2eb90f91f4aea793f8d739939ae3b3095098d9dbb2adc1dcfe3938a7037f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:31:35,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:31:35,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:31:35,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:31:35,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:31:35,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:31:35,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:31:35,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:31:35,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:31:35,812 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:31:35,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:31:35,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:31:35,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:31:35,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:31:35,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:31:35,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:31:35,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:31:35,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:31:35,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:31:35,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:31:35,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:31:35,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:31:35,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:31:35,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:31:35,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:31:35,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:31:35,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:31:35,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:31:35,816 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 577a2eb90f91f4aea793f8d739939ae3b3095098d9dbb2adc1dcfe3938a7037f [2025-03-04 07:31:36,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:31:36,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:31:36,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:31:36,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:31:36,041 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:31:36,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i [2025-03-04 07:31:37,140 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5cfdbbc/efea1e80bf534c2eb123e9d62a030c5b/FLAG631bf971e [2025-03-04 07:31:37,420 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:31:37,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i [2025-03-04 07:31:37,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5cfdbbc/efea1e80bf534c2eb123e9d62a030c5b/FLAG631bf971e [2025-03-04 07:31:37,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5cfdbbc/efea1e80bf534c2eb123e9d62a030c5b [2025-03-04 07:31:37,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:31:37,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:31:37,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:31:37,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:31:37,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:31:37,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:31:37" (1/1) ... [2025-03-04 07:31:37,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bbe5db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:37, skipping insertion in model container [2025-03-04 07:31:37,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:31:37" (1/1) ... [2025-03-04 07:31:37,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:31:37,939 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:31:37,940 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:31:37,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:31:37,949 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:31:37,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:31:38,011 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:31:38,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38 WrapperNode [2025-03-04 07:31:38,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:31:38,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:31:38,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:31:38,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:31:38,016 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:31:38" (1/1) ... [2025-03-04 07:31:38,023 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:31:38" (1/1) ... [2025-03-04 07:31:38,037 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2025-03-04 07:31:38,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:31:38,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:31:38,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:31:38,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:31:38,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,056 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-03-04 07:31:38,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:31:38,069 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:31:38,069 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:31:38,069 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:31:38,069 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (1/1) ... [2025-03-04 07:31:38,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:31:38,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:38,099 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:31:38,101 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:31:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:31:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:31:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:31:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:31:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:31:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:31:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:31:38,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:31:38,182 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:31:38,183 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:31:38,319 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc main_#t~ret217#1;call ULTIMATE.dealloc(main_#t~malloc215#1.base, main_#t~malloc215#1.offset);havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call ULTIMATE.dealloc(main_#t~malloc216#1.base, main_#t~malloc216#1.offset);havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset; [2025-03-04 07:31:38,327 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-04 07:31:38,327 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:31:38,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:31:38,335 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:31:38,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:31:38 BoogieIcfgContainer [2025-03-04 07:31:38,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:31:38,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:31:38,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:31:38,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:31:38,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:31:37" (1/3) ... [2025-03-04 07:31:38,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec14047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:31:38, skipping insertion in model container [2025-03-04 07:31:38,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:38" (2/3) ... [2025-03-04 07:31:38,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec14047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:31:38, skipping insertion in model container [2025-03-04 07:31:38,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:31:38" (3/3) ... [2025-03-04 07:31:38,343 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcmp_mixed_alloca.i [2025-03-04 07:31:38,352 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:31:38,354 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcmp_mixed_alloca.i that has 1 procedures, 38 locations, 1 initial locations, 1 loop locations, and 15 error locations. [2025-03-04 07:31:38,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:31:38,394 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;@7432aeef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:31:38,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 07:31:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 37 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:31:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:31:38,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:38,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:31:38,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:38,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:38,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2077225988, now seen corresponding path program 1 times [2025-03-04 07:31:38,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:38,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132247513] [2025-03-04 07:31:38,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:38,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:38,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:31:38,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:31:38,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:38,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:38,629 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:31:38,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:38,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132247513] [2025-03-04 07:31:38,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132247513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:38,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:38,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:38,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709121505] [2025-03-04 07:31:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:38,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:38,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:38,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:38,649 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 37 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) 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:31:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:38,688 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-03-04 07:31:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:38,690 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:31:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:38,694 INFO L225 Difference]: With dead ends: 37 [2025-03-04 07:31:38,694 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 07:31:38,695 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:31:38,697 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:38,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 07:31:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 07:31:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 34 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:31:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-04 07:31:38,724 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 6 [2025-03-04 07:31:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:38,724 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-04 07:31:38,724 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:31:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-04 07:31:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:31:38,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:38,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:31:38,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:31:38,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:38,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:38,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2077225987, now seen corresponding path program 1 times [2025-03-04 07:31:38,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:38,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934516099] [2025-03-04 07:31:38,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:38,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:31:38,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:31:38,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:38,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:38,937 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:31:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:38,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934516099] [2025-03-04 07:31:38,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934516099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:38,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:38,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:31:38,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972576760] [2025-03-04 07:31:38,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:38,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:31:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:38,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:31:38,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:31:38,941 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:38,958 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-03-04 07:31:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:31:38,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:31:38,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:38,960 INFO L225 Difference]: With dead ends: 38 [2025-03-04 07:31:38,960 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 07:31:38,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:31:38,961 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:38,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 07:31:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 07:31:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.75) internal successors, (42), 37 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:31:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-04 07:31:38,966 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 6 [2025-03-04 07:31:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:38,966 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-04 07:31:38,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-04 07:31:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:31:38,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:38,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:31:38,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:31:38,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:38,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2077196196, now seen corresponding path program 1 times [2025-03-04 07:31:38,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:38,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798654113] [2025-03-04 07:31:38,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:38,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:31:38,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:31:38,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:38,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,165 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:31:39,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:39,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798654113] [2025-03-04 07:31:39,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798654113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:39,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:39,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:31:39,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487235353] [2025-03-04 07:31:39,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:39,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:31:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:39,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:31:39,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:31:39,168 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:31:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:39,203 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-03-04 07:31:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:31:39,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:31:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:39,205 INFO L225 Difference]: With dead ends: 37 [2025-03-04 07:31:39,206 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 07:31:39,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:31:39,207 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:39,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 07:31:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2025-03-04 07:31:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 33 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:31:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-03-04 07:31:39,211 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 6 [2025-03-04 07:31:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:39,211 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-03-04 07:31:39,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:31:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-03-04 07:31:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:31:39,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:39,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:39,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:31:39,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:39,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash 30503815, now seen corresponding path program 1 times [2025-03-04 07:31:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:39,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987369860] [2025-03-04 07:31:39,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:39,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:39,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:31:39,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:31:39,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:39,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,247 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:31:39,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:39,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987369860] [2025-03-04 07:31:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987369860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:39,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461389056] [2025-03-04 07:31:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:39,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:39,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:39,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:39,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:39,249 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:39,278 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-03-04 07:31:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:39,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:31:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:39,280 INFO L225 Difference]: With dead ends: 33 [2025-03-04 07:31:39,280 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 07:31:39,281 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:31:39,281 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:39,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 07:31:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 07:31:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 32 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:31:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-03-04 07:31:39,285 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 7 [2025-03-04 07:31:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:39,285 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-03-04 07:31:39,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-03-04 07:31:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:31:39,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:39,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:39,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:31:39,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:39,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 30503816, now seen corresponding path program 1 times [2025-03-04 07:31:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:39,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011448050] [2025-03-04 07:31:39,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:39,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:31:39,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:31:39,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:39,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,363 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:31:39,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:39,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011448050] [2025-03-04 07:31:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011448050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:39,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:31:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547961128] [2025-03-04 07:31:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:39,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:31:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:39,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:31:39,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:31:39,365 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:39,401 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-03-04 07:31:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:31:39,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:31:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:39,402 INFO L225 Difference]: With dead ends: 37 [2025-03-04 07:31:39,402 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 07:31:39,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:31:39,402 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:39,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 83 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 07:31:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-03-04 07:31:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.625) internal successors, (39), 35 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:31:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-03-04 07:31:39,404 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 7 [2025-03-04 07:31:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:39,404 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-03-04 07:31:39,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-03-04 07:31:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:31:39,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:39,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:39,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:31:39,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:39,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:39,406 INFO L85 PathProgramCache]: Analyzing trace with hash 30533607, now seen corresponding path program 1 times [2025-03-04 07:31:39,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:39,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752911138] [2025-03-04 07:31:39,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:39,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:31:39,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:31:39,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:39,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,495 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:31:39,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:39,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752911138] [2025-03-04 07:31:39,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752911138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:39,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:39,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:31:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945482475] [2025-03-04 07:31:39,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:39,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:31:39,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:39,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:31:39,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:31:39,496 INFO L87 Difference]: Start difference. First operand 36 states and 39 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:31:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:39,528 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-03-04 07:31:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:31:39,528 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:31:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:39,528 INFO L225 Difference]: With dead ends: 35 [2025-03-04 07:31:39,528 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 07:31:39,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:31:39,529 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:39,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 101 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 07:31:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-04 07:31:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 31 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:31:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-03-04 07:31:39,531 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 7 [2025-03-04 07:31:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:39,531 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-03-04 07:31:39,531 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:31:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-03-04 07:31:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:31:39,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:39,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:39,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:31:39,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:39,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash -750604797, now seen corresponding path program 1 times [2025-03-04 07:31:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:39,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752894794] [2025-03-04 07:31:39,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:39,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:31:39,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:31:39,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:39,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,571 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:31:39,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:39,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752894794] [2025-03-04 07:31:39,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752894794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:39,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:39,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:31:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937692181] [2025-03-04 07:31:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:39,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:31:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:39,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:31:39,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:31:39,573 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:39,604 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-04 07:31:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:31:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:31:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:39,605 INFO L225 Difference]: With dead ends: 29 [2025-03-04 07:31:39,605 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 07:31:39,605 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:31:39,605 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:39,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 07:31:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 07:31:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 28 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:31:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-03-04 07:31:39,607 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 9 [2025-03-04 07:31:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:39,608 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-04 07:31:39,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-03-04 07:31:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:31:39,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:39,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:39,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:31:39,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:39,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:39,609 INFO L85 PathProgramCache]: Analyzing trace with hash -750604796, now seen corresponding path program 1 times [2025-03-04 07:31:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:39,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874377006] [2025-03-04 07:31:39,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:39,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:39,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:31:39,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:31:39,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:39,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,714 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:31:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874377006] [2025-03-04 07:31:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874377006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:31:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673301475] [2025-03-04 07:31:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:39,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:31:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:39,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:31:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:31:39,716 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:39,762 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-04 07:31:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:31:39,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:31:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:39,763 INFO L225 Difference]: With dead ends: 39 [2025-03-04 07:31:39,763 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 07:31:39,763 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:31:39,764 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:39,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 73 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 07:31:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-03-04 07:31:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:31:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-04 07:31:39,766 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 9 [2025-03-04 07:31:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:39,766 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-04 07:31:39,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-03-04 07:31:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:31:39,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:39,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:39,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:31:39,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:39,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash -161184866, now seen corresponding path program 1 times [2025-03-04 07:31:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:39,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392546722] [2025-03-04 07:31:39,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:39,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:31:39,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:31:39,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:39,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,811 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:31:39,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:39,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392546722] [2025-03-04 07:31:39,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392546722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:39,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:39,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:31:39,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224754480] [2025-03-04 07:31:39,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:39,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:31:39,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:39,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:31:39,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:31:39,813 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:31:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:39,842 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-03-04 07:31:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:31:39,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:31:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:39,843 INFO L225 Difference]: With dead ends: 35 [2025-03-04 07:31:39,843 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 07:31:39,843 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:31:39,843 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 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:31:39,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 07:31:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 07:31:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-03-04 07:31:39,845 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 13 [2025-03-04 07:31:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:39,845 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-04 07:31:39,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:31:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-03-04 07:31:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:31:39,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:39,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:39,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:31:39,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:39,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:39,847 INFO L85 PathProgramCache]: Analyzing trace with hash -161184865, now seen corresponding path program 1 times [2025-03-04 07:31:39,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:39,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830477285] [2025-03-04 07:31:39,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:39,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:39,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:31:39,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:31:39,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:39,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,975 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:31:39,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830477285] [2025-03-04 07:31:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830477285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:31:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629529887] [2025-03-04 07:31:39,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:31:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:39,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:31:39,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:31:39,976 INFO L87 Difference]: Start difference. First operand 35 states and 41 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:31:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:40,029 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-03-04 07:31:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:31:40,030 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:31:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:40,031 INFO L225 Difference]: With dead ends: 51 [2025-03-04 07:31:40,031 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 07:31:40,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:31:40,031 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:40,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 76 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 07:31:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-04 07:31:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-03-04 07:31:40,037 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 13 [2025-03-04 07:31:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:40,037 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-03-04 07:31:40,037 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:31:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-03-04 07:31:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:31:40,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:40,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:40,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:31:40,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash -161184050, now seen corresponding path program 1 times [2025-03-04 07:31:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451558960] [2025-03-04 07:31:40,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:40,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:31:40,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:31:40,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:40,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:40,064 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:31:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451558960] [2025-03-04 07:31:40,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451558960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:40,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:40,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:31:40,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793981825] [2025-03-04 07:31:40,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:40,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:40,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:40,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:40,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:40,066 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:31:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:40,074 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2025-03-04 07:31:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:31:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:40,075 INFO L225 Difference]: With dead ends: 51 [2025-03-04 07:31:40,075 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 07:31:40,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:31:40,076 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:40,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 07:31:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-04 07:31:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-04 07:31:40,077 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 13 [2025-03-04 07:31:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:40,077 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-04 07:31:40,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:31:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-04 07:31:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:31:40,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:40,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:40,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:31:40,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:40,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash -357698370, now seen corresponding path program 1 times [2025-03-04 07:31:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101025447] [2025-03-04 07:31:40,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:40,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:31:40,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:31:40,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:40,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:40,267 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:31:40,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101025447] [2025-03-04 07:31:40,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101025447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:40,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:40,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:31:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560955688] [2025-03-04 07:31:40,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:40,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:31:40,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:40,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:31:40,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:31:40,268 INFO L87 Difference]: Start difference. First operand 51 states and 59 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:31:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:40,310 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-03-04 07:31:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:31:40,310 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:31:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:40,311 INFO L225 Difference]: With dead ends: 54 [2025-03-04 07:31:40,311 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 07:31:40,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:31:40,311 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:40,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 07:31:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2025-03-04 07:31:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-04 07:31:40,313 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 13 [2025-03-04 07:31:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:40,313 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-04 07:31:40,313 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:31:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-04 07:31:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:31:40,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:40,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:40,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:31:40,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:40,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash -84918014, now seen corresponding path program 1 times [2025-03-04 07:31:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:40,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396245627] [2025-03-04 07:31:40,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:40,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:40,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:31:40,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:31:40,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:40,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:40,431 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:31:40,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:40,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396245627] [2025-03-04 07:31:40,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396245627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:40,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:40,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:31:40,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335887134] [2025-03-04 07:31:40,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:40,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:31:40,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:40,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:31:40,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:31:40,433 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:40,484 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-03-04 07:31:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:31:40,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:31:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:40,485 INFO L225 Difference]: With dead ends: 50 [2025-03-04 07:31:40,485 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 07:31:40,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:31:40,485 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:40,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 136 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 07:31:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-04 07:31:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 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:31:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-03-04 07:31:40,488 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 16 [2025-03-04 07:31:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:40,488 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-03-04 07:31:40,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-03-04 07:31:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:31:40,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:40,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:40,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:31:40,489 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:40,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:40,489 INFO L85 PathProgramCache]: Analyzing trace with hash -590476639, now seen corresponding path program 1 times [2025-03-04 07:31:40,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:40,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615084554] [2025-03-04 07:31:40,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:40,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:31:40,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:31:40,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:40,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:40,695 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:31:40,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615084554] [2025-03-04 07:31:40,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615084554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:31:40,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349914155] [2025-03-04 07:31:40,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:40,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:31:40,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:40,698 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:31:40,699 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:31:40,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:31:40,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:31:40,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:40,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:40,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:31:40,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:31:40,814 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:31:40,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:31:40,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 07:31:41,061 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:31:41,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:31:41,292 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:31:41,300 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 20 [2025-03-04 07:31:41,310 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:31:41,318 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:31:41,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349914155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:31:41,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:31:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-03-04 07:31:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857790856] [2025-03-04 07:31:41,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:31:41,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:31:41,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:41,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:31:41,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:31:41,320 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 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:31:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:41,662 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2025-03-04 07:31:41,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:31:41,663 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:31:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:41,663 INFO L225 Difference]: With dead ends: 58 [2025-03-04 07:31:41,663 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 07:31:41,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:31:41,664 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:41,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:31:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 07:31:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2025-03-04 07:31:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-03-04 07:31:41,667 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 16 [2025-03-04 07:31:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:41,667 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-03-04 07:31:41,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 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:31:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-03-04 07:31:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:31:41,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:41,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:41,674 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:31:41,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 07:31:41,872 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:41,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash 474180490, now seen corresponding path program 1 times [2025-03-04 07:31:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:41,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509716388] [2025-03-04 07:31:41,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:41,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:31:41,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:31:41,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:41,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:41,994 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:31:41,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509716388] [2025-03-04 07:31:41,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509716388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:41,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:41,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:31:41,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086840641] [2025-03-04 07:31:41,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:41,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:31:41,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:41,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:31:41,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:31:41,995 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:42,018 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-04 07:31:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:31:42,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 07:31:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:42,019 INFO L225 Difference]: With dead ends: 45 [2025-03-04 07:31:42,019 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:31:42,019 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:31:42,019 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:42,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:31:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 07:31:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 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:31:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-03-04 07:31:42,021 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 18 [2025-03-04 07:31:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:42,021 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-03-04 07:31:42,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-03-04 07:31:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:31:42,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:42,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:42,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:31:42,022 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:42,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:42,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1535527356, now seen corresponding path program 1 times [2025-03-04 07:31:42,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:42,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054032531] [2025-03-04 07:31:42,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:42,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:42,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:31:42,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:31:42,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:42,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054032531] [2025-03-04 07:31:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054032531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:31:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113940667] [2025-03-04 07:31:42,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:42,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:31:42,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:42,366 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:31:42,368 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:31:42,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:31:42,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:31:42,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:42,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:42,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:31:42,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:31:42,443 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:31:42,550 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 16 treesize of output 8 [2025-03-04 07:31:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:42,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:31:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113940667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:42,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:31:42,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2025-03-04 07:31:42,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998326336] [2025-03-04 07:31:42,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:42,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:31:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:42,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:31:42,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:31:42,604 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:31:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:42,700 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2025-03-04 07:31:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:31:42,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:31:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:42,701 INFO L225 Difference]: With dead ends: 41 [2025-03-04 07:31:42,701 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:31:42,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:31:42,702 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:42,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 103 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:31:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:31:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 07:31:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 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:31:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-03-04 07:31:42,709 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 20 [2025-03-04 07:31:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:42,709 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-03-04 07:31:42,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:31:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-03-04 07:31:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:31:42,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:42,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:42,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:31:42,910 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,SelfDestructingSolverStorable15 [2025-03-04 07:31:42,910 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:42,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:42,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1406130243, now seen corresponding path program 1 times [2025-03-04 07:31:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:42,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886155369] [2025-03-04 07:31:42,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:42,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:42,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:31:42,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:31:42,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:42,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:43,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886155369] [2025-03-04 07:31:43,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886155369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:31:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871634783] [2025-03-04 07:31:43,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:43,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:31:43,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:43,198 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:31:43,199 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:31:43,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:31:43,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:31:43,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:43,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:43,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 07:31:43,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:31:43,296 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:31:43,468 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 16 treesize of output 8 [2025-03-04 07:31:43,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:31:43,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:31:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:43,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:31:43,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:31:43,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-04 07:31:43,816 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 10 treesize of output 8 [2025-03-04 07:31:43,820 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:31:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871634783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:31:43,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:31:43,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2025-03-04 07:31:43,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754959348] [2025-03-04 07:31:43,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:31:43,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:31:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:43,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:31:43,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:31:43,870 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:44,111 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2025-03-04 07:31:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:31:44,112 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:31:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:44,112 INFO L225 Difference]: With dead ends: 40 [2025-03-04 07:31:44,112 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 07:31:44,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1149, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:31:44,114 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:44,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 119 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:31:44,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 07:31:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-04 07:31:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.096774193548387) internal successors, (34), 33 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:31:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2025-03-04 07:31:44,118 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 20 [2025-03-04 07:31:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:44,118 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2025-03-04 07:31:44,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2025-03-04 07:31:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:31:44,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:44,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:44,126 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:31:44,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:31:44,319 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:44,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1210073052, now seen corresponding path program 1 times [2025-03-04 07:31:44,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:44,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853625308] [2025-03-04 07:31:44,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:44,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:44,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:31:44,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:31:44,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:44,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:44,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853625308] [2025-03-04 07:31:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853625308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:31:44,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805945709] [2025-03-04 07:31:44,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:44,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:31:44,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:44,599 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:31:44,601 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:31:44,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:31:44,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:31:44,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:44,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:44,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 07:31:44,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:31:44,675 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:31:44,988 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-04 07:31:44,988 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:31:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:45,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:31:45,432 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:31:45,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 07:31:45,439 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:31:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:45,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805945709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:31:45,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:31:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2025-03-04 07:31:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076752293] [2025-03-04 07:31:45,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:31:45,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:31:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:45,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:31:45,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:31:45,467 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:46,241 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2025-03-04 07:31:46,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:31:46,241 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:31:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:46,242 INFO L225 Difference]: With dead ends: 35 [2025-03-04 07:31:46,242 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 07:31:46,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=279, Invalid=1613, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 07:31:46,243 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:46,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 134 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:31:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 07:31:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-04 07:31:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 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:31:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2025-03-04 07:31:46,244 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 23 [2025-03-04 07:31:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:46,248 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2025-03-04 07:31:46,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2025-03-04 07:31:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:31:46,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:46,249 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:46,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:31:46,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 07:31:46,453 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 07:31:46,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1139508671, now seen corresponding path program 2 times [2025-03-04 07:31:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:46,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948370748] [2025-03-04 07:31:46,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:31:46,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:46,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 07:31:46,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:31:46,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:31:46,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:46,763 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:31:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:46,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948370748] [2025-03-04 07:31:46,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948370748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:31:46,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731820584] [2025-03-04 07:31:46,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:31:46,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:31:46,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:46,765 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:31:46,768 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:31:46,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 07:31:46,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:31:46,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:31:46,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:46,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 07:31:46,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:31:46,843 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:31:46,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:31:46,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:31:46,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:31:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:47,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:31:47,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-04 07:31:47,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-03-04 07:31:47,326 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 10 treesize of output 8 [2025-03-04 07:31:47,327 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:31:47,329 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:31:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731820584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:31:47,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:31:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-03-04 07:31:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797962674] [2025-03-04 07:31:47,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:31:47,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:31:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:47,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:31:47,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:31:47,330 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:47,648 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2025-03-04 07:31:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:31:47,648 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 07:31:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:47,649 INFO L225 Difference]: With dead ends: 33 [2025-03-04 07:31:47,649 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:31:47,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1462, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 07:31:47,650 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:47,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 123 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:31:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:31:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:31:47,650 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:31:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:31:47,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2025-03-04 07:31:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:47,650 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:31:47,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:47,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:31:47,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:31:47,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-03-04 07:31:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-04 07:31:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-04 07:31:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2025-03-04 07:31:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-04 07:31:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-04 07:31:47,660 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:31:47,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:31:47,857 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:47,858 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:31:47,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:31:47 BoogieIcfgContainer [2025-03-04 07:31:47,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:31:47,860 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:31:47,860 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:31:47,860 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:31:47,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:31:38" (3/4) ... [2025-03-04 07:31:47,863 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:31:47,870 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 07:31:47,870 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 07:31:47,871 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 07:31:47,871 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:31:47,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:31:47,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:31:47,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:31:47,926 INFO L158 Benchmark]: Toolchain (without parser) took 10209.61ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 122.1MB in the beginning and 140.4MB in the end (delta: -18.2MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. [2025-03-04 07:31:47,926 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:31:47,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.36ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 104.0MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:31:47,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.53ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 102.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:31:47,927 INFO L158 Benchmark]: Boogie Preprocessor took 30.65ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:31:47,928 INFO L158 Benchmark]: IcfgBuilder took 266.64ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 85.1MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:31:47,928 INFO L158 Benchmark]: TraceAbstraction took 9523.15ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 84.5MB in the beginning and 144.8MB in the end (delta: -60.3MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. [2025-03-04 07:31:47,928 INFO L158 Benchmark]: Witness Printer took 64.86ms. Allocated memory is still 360.7MB. Free memory was 144.8MB in the beginning and 140.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:31:47,929 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.42ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.36ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 104.0MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.53ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 102.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.65ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 266.64ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 85.1MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9523.15ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 84.5MB in the beginning and 144.8MB in the end (delta: -60.3MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. * Witness Printer took 64.86ms. Allocated memory is still 360.7MB. Free memory was 144.8MB in the beginning and 140.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 375]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 1633 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1201 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1904 IncrementalHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 432 mSDtfsCounter, 1904 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 123 SyntacticMatches, 8 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=11, InterpolantAutomatonStates: 144, 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, 19 MinimizatonAttempts, 42 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 413 ConstructedInterpolants, 25 QuantifiedInterpolants, 4334 SizeOfPredicates, 39 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 13/108 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 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:31:47,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE