./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.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 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:49:20,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:49:20,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 11:49:20,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:49:20,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:49:20,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:49:20,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:49:20,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:49:20,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:49:20,812 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:49:20,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:49:20,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:49:20,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:49:20,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:49:20,813 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:49:20,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:49:20,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:49:20,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:49:20,814 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:49:20,814 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:49:20,814 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:49:20,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:49:20,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:49:20,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:49:20,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:49:20,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:49:20,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:49:20,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:49:20,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:49:20,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:49:20,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:49:20,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:49:20,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:49:20,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:49:20,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:49:20,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:49:20,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:49:20,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:49:20,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:49:20,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 -> 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e [2025-03-17 11:49:21,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:49:21,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:49:21,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:49:21,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:49:21,061 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:49:21,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2025-03-17 11:49:22,227 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8597f5890/31b175958134464e9119c2baa96df9a6/FLAG7a09d9b5b [2025-03-17 11:49:22,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:49:22,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2025-03-17 11:49:22,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8597f5890/31b175958134464e9119c2baa96df9a6/FLAG7a09d9b5b [2025-03-17 11:49:22,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8597f5890/31b175958134464e9119c2baa96df9a6 [2025-03-17 11:49:22,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:49:22,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:49:22,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:49:22,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:49:22,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:49:22,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:49:22" (1/1) ... [2025-03-17 11:49:22,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f23a3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:22, skipping insertion in model container [2025-03-17 11:49:22,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:49:22" (1/1) ... [2025-03-17 11:49:22,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:49:22,981 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:49:22,982 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:49:22,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:49:22,990 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:49:23,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:49:23,043 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:49:23,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23 WrapperNode [2025-03-17 11:49:23,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:49:23,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:49:23,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:49:23,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:49:23,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,072 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-03-17 11:49:23,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:49:23,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:49:23,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:49:23,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:49:23,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,090 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [1, 2]. 67 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-17 11:49:23,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:49:23,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:49:23,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:49:23,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:49:23,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (1/1) ... [2025-03-17 11:49:23,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:49:23,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:49:23,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:49:23,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:49:23,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:49:23,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:49:23,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:49:23,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:49:23,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:49:23,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:49:23,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:49:23,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:49:23,201 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:49:23,202 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:49:23,313 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; [2025-03-17 11:49:23,320 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-17 11:49:23,320 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:49:23,325 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:49:23,325 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:49:23,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:49:23 BoogieIcfgContainer [2025-03-17 11:49:23,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:49:23,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:49:23,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:49:23,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:49:23,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:49:22" (1/3) ... [2025-03-17 11:49:23,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b047255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:49:23, skipping insertion in model container [2025-03-17 11:49:23,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:49:23" (2/3) ... [2025-03-17 11:49:23,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b047255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:49:23, skipping insertion in model container [2025-03-17 11:49:23,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:49:23" (3/3) ... [2025-03-17 11:49:23,333 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-2.i [2025-03-17 11:49:23,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:49:23,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcpy-alloca-2.i that has 1 procedures, 21 locations, 1 initial locations, 1 loop locations, and 7 error locations. [2025-03-17 11:49:23,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:49:23,387 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;@4bcc6dd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:49:23,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:49:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:49:23,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:23,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:49:23,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 55286021, now seen corresponding path program 1 times [2025-03-17 11:49:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881213750] [2025-03-17 11:49:23,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:23,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:49:23,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:49:23,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:23,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:23,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881213750] [2025-03-17 11:49:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881213750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:23,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:49:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672655596] [2025-03-17 11:49:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:23,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:49:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:23,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:49:23,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:49:23,566 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:23,601 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-03-17 11:49:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:49:23,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:49:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:23,608 INFO L225 Difference]: With dead ends: 22 [2025-03-17 11:49:23,608 INFO L226 Difference]: Without dead ends: 20 [2025-03-17 11:49:23,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:49:23,611 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:23,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-17 11:49:23,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-17 11:49:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-17 11:49:23,637 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 5 [2025-03-17 11:49:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:23,637 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-17 11:49:23,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-17 11:49:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:49:23,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:23,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:49:23,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:49:23,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:23,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash 55286099, now seen corresponding path program 1 times [2025-03-17 11:49:23,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775345915] [2025-03-17 11:49:23,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:23,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:23,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:49:23,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:49:23,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:23,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:23,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775345915] [2025-03-17 11:49:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775345915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:23,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:23,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:49:23,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818560610] [2025-03-17 11:49:23,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:23,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:49:23,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:23,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:49:23,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:49:23,747 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:23,768 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2025-03-17 11:49:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:49:23,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:49:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:23,769 INFO L225 Difference]: With dead ends: 19 [2025-03-17 11:49:23,769 INFO L226 Difference]: Without dead ends: 19 [2025-03-17 11:49:23,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:49:23,771 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:23,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-17 11:49:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-17 11:49:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-17 11:49:23,773 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 5 [2025-03-17 11:49:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:23,773 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-17 11:49:23,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-17 11:49:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:49:23,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:23,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:49:23,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:49:23,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:23,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash 55286100, now seen corresponding path program 1 times [2025-03-17 11:49:23,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613499922] [2025-03-17 11:49:23,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:23,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:49:23,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:49:23,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:23,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:23,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:23,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613499922] [2025-03-17 11:49:23,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613499922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:23,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:23,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:49:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27105464] [2025-03-17 11:49:23,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:23,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:49:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:23,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:49:23,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:49:23,957 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:23,970 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2025-03-17 11:49:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:49:23,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:49:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:23,971 INFO L225 Difference]: With dead ends: 20 [2025-03-17 11:49:23,971 INFO L226 Difference]: Without dead ends: 20 [2025-03-17 11:49:23,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:49:23,972 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:23,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-17 11:49:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-17 11:49:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-17 11:49:23,974 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 5 [2025-03-17 11:49:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:23,974 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-17 11:49:23,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-17 11:49:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:49:23,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:23,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:49:23,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:49:23,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:23,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:23,975 INFO L85 PathProgramCache]: Analyzing trace with hash 55286982, now seen corresponding path program 1 times [2025-03-17 11:49:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:23,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682777078] [2025-03-17 11:49:23,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:23,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:49:23,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:49:23,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:23,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:23,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682777078] [2025-03-17 11:49:23,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682777078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:23,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:49:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309670606] [2025-03-17 11:49:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:23,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:49:23,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:23,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:49:23,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:49:23,994 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:24,004 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-17 11:49:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:49:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:49:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:24,005 INFO L225 Difference]: With dead ends: 21 [2025-03-17 11:49:24,005 INFO L226 Difference]: Without dead ends: 20 [2025-03-17 11:49:24,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:49:24,006 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:24,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-17 11:49:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-17 11:49:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-17 11:49:24,009 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 5 [2025-03-17 11:49:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:24,009 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-17 11:49:24,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-17 11:49:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:49:24,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:24,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:49:24,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:49:24,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:24,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash 55287061, now seen corresponding path program 1 times [2025-03-17 11:49:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:24,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815659807] [2025-03-17 11:49:24,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:24,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:24,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:49:24,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:49:24,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:24,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815659807] [2025-03-17 11:49:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815659807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:24,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:49:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987229310] [2025-03-17 11:49:24,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:24,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:49:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:24,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:49:24,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:49:24,170 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:24,188 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-03-17 11:49:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:49:24,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:49:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:24,188 INFO L225 Difference]: With dead ends: 19 [2025-03-17 11:49:24,188 INFO L226 Difference]: Without dead ends: 19 [2025-03-17 11:49:24,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:49:24,190 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:24,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-17 11:49:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-17 11:49:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-17 11:49:24,194 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 5 [2025-03-17 11:49:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:24,194 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-17 11:49:24,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-17 11:49:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:49:24,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:24,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:24,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:49:24,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:24,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2055685979, now seen corresponding path program 1 times [2025-03-17 11:49:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108854808] [2025-03-17 11:49:24,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:24,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:49:24,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:49:24,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:24,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108854808] [2025-03-17 11:49:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108854808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:24,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:49:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877356239] [2025-03-17 11:49:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:24,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:49:24,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:24,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:49:24,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:49:24,296 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:24,334 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2025-03-17 11:49:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:49:24,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 11:49:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:24,335 INFO L225 Difference]: With dead ends: 16 [2025-03-17 11:49:24,335 INFO L226 Difference]: Without dead ends: 16 [2025-03-17 11:49:24,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:49:24,335 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:24,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 26 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-17 11:49:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-17 11:49:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-17 11:49:24,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2025-03-17 11:49:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:24,337 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-17 11:49:24,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-17 11:49:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:49:24,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:24,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:24,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:49:24,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:24,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2055685980, now seen corresponding path program 1 times [2025-03-17 11:49:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:24,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7650366] [2025-03-17 11:49:24,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:24,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:49:24,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:49:24,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:24,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7650366] [2025-03-17 11:49:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7650366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:24,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:24,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:49:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047637157] [2025-03-17 11:49:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:24,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:49:24,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:24,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:49:24,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:49:24,502 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:24,542 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-03-17 11:49:24,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:49:24,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 11:49:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:24,543 INFO L225 Difference]: With dead ends: 18 [2025-03-17 11:49:24,543 INFO L226 Difference]: Without dead ends: 18 [2025-03-17 11:49:24,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:49:24,544 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:24,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:24,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-17 11:49:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-17 11:49:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 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-17 11:49:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-17 11:49:24,548 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 8 [2025-03-17 11:49:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:24,548 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-17 11:49:24,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-17 11:49:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:49:24,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:24,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:24,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:49:24,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:24,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash -698244114, now seen corresponding path program 1 times [2025-03-17 11:49:24,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:24,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916894442] [2025-03-17 11:49:24,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:24,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:24,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:49:24,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:49:24,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:24,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:24,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:24,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916894442] [2025-03-17 11:49:24,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916894442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:24,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:49:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127659659] [2025-03-17 11:49:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:24,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:49:24,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:24,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:49:24,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:49:24,634 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-17 11:49:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:24,664 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2025-03-17 11:49:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:49:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-17 11:49:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:24,666 INFO L225 Difference]: With dead ends: 17 [2025-03-17 11:49:24,666 INFO L226 Difference]: Without dead ends: 17 [2025-03-17 11:49:24,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:49:24,667 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:24,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 25 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-17 11:49:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-17 11:49:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-17 11:49:24,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 9 [2025-03-17 11:49:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:24,668 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-17 11:49:24,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-17 11:49:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-17 11:49:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:49:24,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:24,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:24,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:49:24,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:24,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash -698244113, now seen corresponding path program 1 times [2025-03-17 11:49:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:24,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461381312] [2025-03-17 11:49:24,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:24,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:49:24,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:49:24,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:24,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:24,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461381312] [2025-03-17 11:49:24,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461381312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:24,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:24,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:49:24,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155678739] [2025-03-17 11:49:24,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:24,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:49:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:24,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:49:24,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:49:24,836 INFO L87 Difference]: Start difference. First operand 17 states and 19 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-17 11:49:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:24,870 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-03-17 11:49:24,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:49:24,871 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-17 11:49:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:24,872 INFO L225 Difference]: With dead ends: 24 [2025-03-17 11:49:24,872 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 11:49:24,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:49:24,872 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:24,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 11:49:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 11:49:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-17 11:49:24,874 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2025-03-17 11:49:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:24,874 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-17 11:49:24,874 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-17 11:49:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-17 11:49:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:49:24,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:24,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:24,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:49:24,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:24,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1044566222, now seen corresponding path program 1 times [2025-03-17 11:49:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:24,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739140833] [2025-03-17 11:49:24,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:24,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:49:24,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:49:24,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:24,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:25,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:25,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739140833] [2025-03-17 11:49:25,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739140833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:25,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:25,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:49:25,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83107488] [2025-03-17 11:49:25,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:25,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:49:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:25,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:49:25,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:49:25,045 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 7 states, 6 states have (on average 1.5) 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-17 11:49:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:25,080 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-17 11:49:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:49:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) 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-17 11:49:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:25,081 INFO L225 Difference]: With dead ends: 25 [2025-03-17 11:49:25,081 INFO L226 Difference]: Without dead ends: 25 [2025-03-17 11:49:25,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:49:25,081 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:25,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-17 11:49:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2025-03-17 11:49:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 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-17 11:49:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-17 11:49:25,083 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2025-03-17 11:49:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:25,085 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-17 11:49:25,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) 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-17 11:49:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-17 11:49:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:49:25,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:25,086 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:49:25,086 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:25,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash -863810217, now seen corresponding path program 1 times [2025-03-17 11:49:25,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:25,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898985663] [2025-03-17 11:49:25,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:25,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:49:25,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:49:25,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:25,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898985663] [2025-03-17 11:49:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898985663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:49:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012565594] [2025-03-17 11:49:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:25,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:49:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:25,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:49:25,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:49:25,216 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:25,250 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-03-17 11:49:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:49:25,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:49:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:25,251 INFO L225 Difference]: With dead ends: 25 [2025-03-17 11:49:25,251 INFO L226 Difference]: Without dead ends: 25 [2025-03-17 11:49:25,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:49:25,251 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:25,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-17 11:49:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 11:49:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-03-17 11:49:25,253 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2025-03-17 11:49:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:25,253 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-03-17 11:49:25,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-03-17 11:49:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:49:25,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:25,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:25,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:49:25,257 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:25,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash -863809546, now seen corresponding path program 1 times [2025-03-17 11:49:25,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:25,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612494326] [2025-03-17 11:49:25,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:25,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:25,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:49:25,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:49:25,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:25,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612494326] [2025-03-17 11:49:25,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612494326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:25,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:25,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:49:25,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426536050] [2025-03-17 11:49:25,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:25,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:49:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:25,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:49:25,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:49:25,341 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:25,351 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-03-17 11:49:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:49:25,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:49:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:25,352 INFO L225 Difference]: With dead ends: 24 [2025-03-17 11:49:25,352 INFO L226 Difference]: Without dead ends: 15 [2025-03-17 11:49:25,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:49:25,352 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:25,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-17 11:49:25,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-17 11:49:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-17 11:49:25,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2025-03-17 11:49:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:25,354 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-17 11:49:25,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-17 11:49:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:49:25,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:25,354 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:25,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:49:25,355 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:25,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1060323722, now seen corresponding path program 1 times [2025-03-17 11:49:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170012033] [2025-03-17 11:49:25,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:25,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:49:25,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:49:25,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:25,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:25,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:25,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170012033] [2025-03-17 11:49:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170012033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:49:25,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:49:25,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:49:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271222953] [2025-03-17 11:49:25,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:49:25,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:49:25,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:25,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:49:25,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:49:25,507 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:25,535 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2025-03-17 11:49:25,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:49:25,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:49:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:25,536 INFO L225 Difference]: With dead ends: 23 [2025-03-17 11:49:25,536 INFO L226 Difference]: Without dead ends: 15 [2025-03-17 11:49:25,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:49:25,536 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:25,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:49:25,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-17 11:49:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-17 11:49:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-17 11:49:25,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2025-03-17 11:49:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:25,538 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-17 11:49:25,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-17 11:49:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:49:25,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:25,539 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:25,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:49:25,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:25,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1437692215, now seen corresponding path program 1 times [2025-03-17 11:49:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:25,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510318910] [2025-03-17 11:49:25,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:25,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:49:25,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:49:25,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:25,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:25,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510318910] [2025-03-17 11:49:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510318910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:49:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378809079] [2025-03-17 11:49:25,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:25,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:49:25,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:49:25,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:49:25,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:49:25,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:49:25,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:49:25,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:25,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:25,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 11:49:25,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:49:25,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:49:26,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:49:26,092 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 20 treesize of output 17 [2025-03-17 11:49:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:26,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:49:26,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-17 11:49:26,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-17 11:49:26,504 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 13 treesize of output 9 [2025-03-17 11:49:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378809079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:49:26,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:49:26,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-03-17 11:49:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434281617] [2025-03-17 11:49:26,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:49:26,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:49:26,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:26,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:49:26,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:49:26,518 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:26,685 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-17 11:49:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:49:26,685 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:49:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:26,685 INFO L225 Difference]: With dead ends: 18 [2025-03-17 11:49:26,685 INFO L226 Difference]: Without dead ends: 18 [2025-03-17 11:49:26,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:49:26,686 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:26,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:49:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-17 11:49:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-17 11:49:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-17 11:49:26,688 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2025-03-17 11:49:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:26,688 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-17 11:49:26,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-17 11:49:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:49:26,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:26,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:26,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:49:26,893 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-17 11:49:26,893 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:26,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1618785652, now seen corresponding path program 1 times [2025-03-17 11:49:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:26,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504439824] [2025-03-17 11:49:26,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:26,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:49:26,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:49:26,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:26,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:27,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:27,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504439824] [2025-03-17 11:49:27,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504439824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:49:27,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853497047] [2025-03-17 11:49:27,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:49:27,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:49:27,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:49:27,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:49:27,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:49:27,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:49:27,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:49:27,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:49:27,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:27,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-17 11:49:27,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:49:27,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:49:27,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 11:49:27,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 11:49:27,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 11:49:27,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:49:27,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2025-03-17 11:49:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:27,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:49:28,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-17 11:49:28,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 11:49:28,301 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:49:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:28,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853497047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:49:28,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:49:28,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2025-03-17 11:49:28,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958561250] [2025-03-17 11:49:28,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:49:28,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:49:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:28,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:49:28,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:49:28,390 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:28,941 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-17 11:49:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:49:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 11:49:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:28,942 INFO L225 Difference]: With dead ends: 18 [2025-03-17 11:49:28,943 INFO L226 Difference]: Without dead ends: 18 [2025-03-17 11:49:28,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 11:49:28,945 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:28,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:49:28,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-17 11:49:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-17 11:49:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-03-17 11:49:28,948 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2025-03-17 11:49:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:28,948 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-03-17 11:49:28,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-03-17 11:49:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:49:28,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:28,948 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:28,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:49:29,153 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,SelfDestructingSolverStorable14 [2025-03-17 11:49:29,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:29,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1350504882, now seen corresponding path program 2 times [2025-03-17 11:49:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:29,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561573075] [2025-03-17 11:49:29,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:49:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:29,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 11:49:29,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:49:29,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:49:29,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:29,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:29,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561573075] [2025-03-17 11:49:29,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561573075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:49:29,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941879892] [2025-03-17 11:49:29,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:49:29,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:49:29,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:49:29,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:49:29,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:49:29,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 11:49:29,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:49:29,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:49:29,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:29,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 11:49:29,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:49:29,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:49:34,184 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-03-17 11:49:34,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 23 [2025-03-17 11:49:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:34,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:49:34,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 11:49:34,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 11:49:34,594 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 29 treesize of output 23 [2025-03-17 11:49:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941879892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:49:34,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:49:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-03-17 11:49:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594080491] [2025-03-17 11:49:34,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:49:34,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 11:49:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:49:34,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 11:49:34,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=818, Unknown=2, NotChecked=0, Total=930 [2025-03-17 11:49:34,643 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:36,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:49:49,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:49:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:49:49,355 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2025-03-17 11:49:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:49:49,355 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 11:49:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:49:49,355 INFO L225 Difference]: With dead ends: 25 [2025-03-17 11:49:49,356 INFO L226 Difference]: Without dead ends: 25 [2025-03-17 11:49:49,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=181, Invalid=1375, Unknown=4, NotChecked=0, Total=1560 [2025-03-17 11:49:49,357 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:49:49,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2025-03-17 11:49:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-17 11:49:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 11:49:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-03-17 11:49:49,358 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 16 [2025-03-17 11:49:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:49:49,358 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-03-17 11:49:49,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:49:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-03-17 11:49:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:49:49,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:49:49,358 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:49:49,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:49:49,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:49:49,563 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:49:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:49:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -766447064, now seen corresponding path program 3 times [2025-03-17 11:49:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:49:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624573779] [2025-03-17 11:49:49,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:49:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:49:49,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 5 equivalence classes. [2025-03-17 11:49:49,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:49:49,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 11:49:49,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:49:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:49:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624573779] [2025-03-17 11:49:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624573779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:49:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978734264] [2025-03-17 11:49:50,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:49:50,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:49:50,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:49:50,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:49:50,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:49:50,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 5 equivalence classes. [2025-03-17 11:49:50,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:49:50,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 11:49:50,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:49:50,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-17 11:49:50,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:49:50,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:49:50,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:50:13,857 INFO L349 Elim1Store]: treesize reduction 12, result has 88.1 percent of original size [2025-03-17 11:50:13,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 107 [2025-03-17 11:50:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:50:14,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:50:15,565 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 55 treesize of output 47 [2025-03-17 11:50:15,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:50:15,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 127 [2025-03-17 11:50:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:50:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978734264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:50:15,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:50:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 47 [2025-03-17 11:50:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388950211] [2025-03-17 11:50:15,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:50:15,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 11:50:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:15,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 11:50:15,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2022, Unknown=4, NotChecked=0, Total=2256 [2025-03-17 11:50:15,716 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 48 states, 47 states have (on average 1.425531914893617) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:18,135 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2025-03-17 11:50:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 11:50:18,135 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.425531914893617) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-17 11:50:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:18,135 INFO L225 Difference]: With dead ends: 41 [2025-03-17 11:50:18,135 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 11:50:18,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=557, Invalid=4131, Unknown=4, NotChecked=0, Total=4692 [2025-03-17 11:50:18,137 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:18,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:50:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 11:50:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 11:50:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2025-03-17 11:50:18,139 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 24 [2025-03-17 11:50:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:18,139 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2025-03-17 11:50:18,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.425531914893617) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2025-03-17 11:50:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:50:18,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:50:18,140 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:50:18,146 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-17 11:50:18,340 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,SelfDestructingSolverStorable16 [2025-03-17 11:50:18,340 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:50:18,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:50:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1137954540, now seen corresponding path program 4 times [2025-03-17 11:50:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:50:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355508047] [2025-03-17 11:50:18,341 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:50:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:50:18,349 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-17 11:50:18,368 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-03-17 11:50:18,373 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:50:18,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:50:20,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:50:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355508047] [2025-03-17 11:50:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355508047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:50:20,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168461659] [2025-03-17 11:50:20,650 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:50:20,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:50:20,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:50:20,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:50:20,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:50:20,700 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-17 11:50:20,741 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-03-17 11:50:20,741 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:50:20,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:50:20,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-03-17 11:50:20,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:50:20,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 11:50:24,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:50:24,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 127 treesize of output 247 [2025-03-17 11:50:24,411 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 11:50:24,442 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-17 11:50:24,451 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 11:50:24,466 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-17 11:50:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 98 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:50:25,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:50:27,272 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 119 treesize of output 103 [2025-03-17 11:50:27,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 149 [2025-03-17 11:50:27,286 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-17 11:50:27,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 11:50:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:50:27,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168461659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:50:27,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:50:27,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 81 [2025-03-17 11:50:27,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186436474] [2025-03-17 11:50:27,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:50:27,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2025-03-17 11:50:27,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:50:27,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2025-03-17 11:50:27,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=893, Invalid=5749, Unknown=0, NotChecked=0, Total=6642 [2025-03-17 11:50:27,315 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 82 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 82 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:50:28,267 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2025-03-17 11:50:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:50:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 82 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 11:50:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:50:28,268 INFO L225 Difference]: With dead ends: 40 [2025-03-17 11:50:28,268 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 11:50:28,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1007, Invalid=6133, Unknown=0, NotChecked=0, Total=7140 [2025-03-17 11:50:28,273 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:50:28,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:50:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 11:50:28,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 11:50:28,273 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-17 11:50:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 11:50:28,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-03-17 11:50:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:50:28,273 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 11:50:28,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 82 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:50:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 11:50:28,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 11:50:28,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 11:50:28,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-03-17 11:50:28,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-17 11:50:28,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-17 11:50:28,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-17 11:50:28,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2025-03-17 11:50:28,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2025-03-17 11:50:28,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:50:28,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 11:50:28,481 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:50:28,482 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:50:28,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:50:28 BoogieIcfgContainer [2025-03-17 11:50:28,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:50:28,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:50:28,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:50:28,485 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:50:28,485 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:49:23" (3/4) ... [2025-03-17 11:50:28,486 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:50:28,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-17 11:50:28,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:50:28,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 11:50:28,493 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:50:28,543 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:50:28,543 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:50:28,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:50:28,544 INFO L158 Benchmark]: Toolchain (without parser) took 65749.44ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 110.8MB in the beginning and 116.0MB in the end (delta: -5.2MB). Peak memory consumption was 173.9MB. Max. memory is 16.1GB. [2025-03-17 11:50:28,544 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 226.5MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:50:28,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.79ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 94.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:50:28,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.97ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:50:28,545 INFO L158 Benchmark]: Boogie Preprocessor took 24.54ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:50:28,546 INFO L158 Benchmark]: IcfgBuilder took 227.98ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 78.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:50:28,546 INFO L158 Benchmark]: TraceAbstraction took 65156.81ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 77.5MB in the beginning and 119.5MB in the end (delta: -42.0MB). Peak memory consumption was 140.4MB. Max. memory is 16.1GB. [2025-03-17 11:50:28,547 INFO L158 Benchmark]: Witness Printer took 58.46ms. Allocated memory is still 327.2MB. Free memory was 119.5MB in the beginning and 116.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:50:28,548 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.52ms. Allocated memory is still 226.5MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.79ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 94.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.97ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.54ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 227.98ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 78.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 65156.81ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 77.5MB in the beginning and 119.5MB in the end (delta: -42.0MB). Peak memory consumption was 140.4MB. Max. memory is 16.1GB. * Witness Printer took 58.46ms. Allocated memory is still 327.2MB. Free memory was 119.5MB in the beginning and 116.0MB in the end (delta: 3.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: 555]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 25 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 65.1s, OverallIterations: 18, TraceHistogramMax: 9, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 726 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 533 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2113 IncrementalHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 193 mSDtfsCounter, 2113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3752 ImplicationChecksByTransitivity, 47.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=17, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 44.0s InterpolantComputationTime, 314 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 391 ConstructedInterpolants, 77 QuantifiedInterpolants, 12048 SizeOfPredicates, 29 NumberOfNonLiveVariables, 923 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 28 InterpolantComputations, 13 PerfectInterpolantSequences, 102/523 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 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:50:28,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE