./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple_built_from_end.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:13:34,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:13:34,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:13:34,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:13:34,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:13:34,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:13:34,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:13:34,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:13:34,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:13:34,592 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:13:34,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:13:34,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:13:34,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:13:34,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:13:34,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:13:34,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:13:34,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:13:34,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:13:34,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:13:34,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:13:34,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:13:34,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:13:34,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:13:34,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:13:34,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:13:34,598 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2025-03-17 12:13:34,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:13:34,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:13:34,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:13:34,820 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:13:34,820 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:13:34,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2025-03-17 12:13:35,946 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04c88eda/698e0cd92f9b4a69bf71d0678a4ba19b/FLAG1b2a5d1b5 [2025-03-17 12:13:36,235 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:13:36,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2025-03-17 12:13:36,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04c88eda/698e0cd92f9b4a69bf71d0678a4ba19b/FLAG1b2a5d1b5 [2025-03-17 12:13:36,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04c88eda/698e0cd92f9b4a69bf71d0678a4ba19b [2025-03-17 12:13:36,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:13:36,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:13:36,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:13:36,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:13:36,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:13:36,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@607dc325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36, skipping insertion in model container [2025-03-17 12:13:36,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:13:36,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:13:36,524 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:13:36,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:13:36,577 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:13:36,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36 WrapperNode [2025-03-17 12:13:36,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:13:36,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:13:36,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:13:36,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:13:36,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,603 INFO L138 Inliner]: procedures = 124, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 41 [2025-03-17 12:13:36,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:13:36,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:13:36,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:13:36,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:13:36,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,619 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 12:13:36,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:13:36,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:13:36,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:13:36,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:13:36,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (1/1) ... [2025-03-17 12:13:36,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:13:36,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:36,650 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 12:13:36,654 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 12:13:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:13:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:13:36,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:13:36,744 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:13:36,745 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:13:36,877 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L536: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 12:13:36,893 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 12:13:36,893 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:13:36,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:13:36,902 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:13:36,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:13:36 BoogieIcfgContainer [2025-03-17 12:13:36,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:13:36,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:13:36,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:13:36,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:13:36,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:13:36" (1/3) ... [2025-03-17 12:13:36,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cb6983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:13:36, skipping insertion in model container [2025-03-17 12:13:36,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:36" (2/3) ... [2025-03-17 12:13:36,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cb6983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:13:36, skipping insertion in model container [2025-03-17 12:13:36,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:13:36" (3/3) ... [2025-03-17 12:13:36,913 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2025-03-17 12:13:36,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:13:36,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_built_from_end.i that has 1 procedures, 29 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-03-17 12:13:36,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:13:36,969 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;@3f5ddad8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:13:36,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 12:13:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:36,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:13:36,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:36,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:13:36,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1999390, now seen corresponding path program 1 times [2025-03-17 12:13:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831317989] [2025-03-17 12:13:36,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:37,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:13:37,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:13:37,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:37,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:37,084 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 12:13:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831317989] [2025-03-17 12:13:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831317989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:37,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:37,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:13:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491732756] [2025-03-17 12:13:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:37,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 12:13:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:37,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 12:13:37,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:13:37,111 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:37,122 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-03-17 12:13:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 12:13:37,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-17 12:13:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:37,127 INFO L225 Difference]: With dead ends: 28 [2025-03-17 12:13:37,127 INFO L226 Difference]: Without dead ends: 25 [2025-03-17 12:13:37,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:13:37,130 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:37,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-17 12:13:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 12:13:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2025-03-17 12:13:37,157 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 4 [2025-03-17 12:13:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:37,157 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2025-03-17 12:13:37,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2025-03-17 12:13:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:13:37,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:37,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:13:37,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:13:37,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:37,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash 61967132, now seen corresponding path program 1 times [2025-03-17 12:13:37,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245247604] [2025-03-17 12:13:37,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:37,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:13:37,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:13:37,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:37,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:37,226 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 12:13:37,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245247604] [2025-03-17 12:13:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245247604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:37,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:13:37,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280879148] [2025-03-17 12:13:37,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:37,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:13:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:37,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:13:37,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:13:37,231 INFO L87 Difference]: Start difference. First operand 25 states and 26 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 12:13:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:37,271 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-17 12:13:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:13:37,272 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 12:13:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:37,272 INFO L225 Difference]: With dead ends: 23 [2025-03-17 12:13:37,272 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 12:13:37,272 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 12:13:37,273 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 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 12:13:37,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 12:13:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 12:13:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-17 12:13:37,276 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2025-03-17 12:13:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:37,276 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-17 12:13:37,276 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 12:13:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-17 12:13:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:13:37,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:37,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:13:37,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:13:37,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:37,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash 61967133, now seen corresponding path program 1 times [2025-03-17 12:13:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:37,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158523839] [2025-03-17 12:13:37,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:37,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:13:37,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:13:37,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:37,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:37,359 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 12:13:37,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:37,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158523839] [2025-03-17 12:13:37,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158523839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:37,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:37,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:13:37,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449955652] [2025-03-17 12:13:37,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:37,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:13:37,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:37,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:13:37,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:13:37,360 INFO L87 Difference]: Start difference. First operand 23 states and 24 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 12:13:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:37,382 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2025-03-17 12:13:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:13:37,383 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 12:13:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:37,383 INFO L225 Difference]: With dead ends: 21 [2025-03-17 12:13:37,383 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 12:13:37,383 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 12:13:37,385 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:37,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 12:13:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 12:13:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-17 12:13:37,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 5 [2025-03-17 12:13:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:37,388 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-17 12:13:37,388 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 12:13:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-17 12:13:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:13:37,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:37,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:13:37,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:13:37,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:37,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash 61965790, now seen corresponding path program 1 times [2025-03-17 12:13:37,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:37,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143988311] [2025-03-17 12:13:37,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:37,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:37,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:13:37,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:13:37,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:37,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:37,422 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 12:13:37,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143988311] [2025-03-17 12:13:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143988311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:37,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:37,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:13:37,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388953230] [2025-03-17 12:13:37,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:37,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:13:37,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:37,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:13:37,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:13:37,425 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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 12:13:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:37,451 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-03-17 12:13:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:13:37,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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 12:13:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:37,452 INFO L225 Difference]: With dead ends: 27 [2025-03-17 12:13:37,452 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 12:13:37,452 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 12:13:37,453 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:37,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 12:13:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-17 12:13:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-17 12:13:37,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 5 [2025-03-17 12:13:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:37,460 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-17 12:13:37,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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 12:13:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-17 12:13:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:13:37,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:37,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:13:37,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:13:37,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:37,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash 61965808, now seen corresponding path program 1 times [2025-03-17 12:13:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389463890] [2025-03-17 12:13:37,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:37,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:13:37,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:13:37,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:37,483 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 12:13:37,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:37,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389463890] [2025-03-17 12:13:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389463890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:37,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:37,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:13:37,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660622941] [2025-03-17 12:13:37,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:37,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:13:37,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:37,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:13:37,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:13:37,484 INFO L87 Difference]: Start difference. First operand 24 states and 26 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 12:13:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:37,503 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-03-17 12:13:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:13:37,503 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 12:13:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:37,503 INFO L225 Difference]: With dead ends: 25 [2025-03-17 12:13:37,503 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 12:13:37,503 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 12:13:37,504 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 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 12:13:37,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 12:13:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 12:13:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-17 12:13:37,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2025-03-17 12:13:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:37,506 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-17 12:13:37,506 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 12:13:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-17 12:13:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:13:37,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:37,506 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:37,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:13:37,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:37,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1927199830, now seen corresponding path program 1 times [2025-03-17 12:13:37,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:37,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815610650] [2025-03-17 12:13:37,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:37,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:37,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:13:37,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:13:37,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:37,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:37,574 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 12:13:37,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:37,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815610650] [2025-03-17 12:13:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815610650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:37,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:37,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:13:37,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569826466] [2025-03-17 12:13:37,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:37,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:13:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:37,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:13:37,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:13:37,575 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:37,621 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-17 12:13:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:13:37,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:13:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:37,622 INFO L225 Difference]: With dead ends: 27 [2025-03-17 12:13:37,622 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 12:13:37,622 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 12:13:37,622 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:37,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 12:13:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-17 12:13:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) 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 12:13:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-17 12:13:37,624 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2025-03-17 12:13:37,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:37,625 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-17 12:13:37,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-17 12:13:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:13:37,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:37,625 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:37,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:13:37,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:37,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1927199831, now seen corresponding path program 1 times [2025-03-17 12:13:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:37,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534122188] [2025-03-17 12:13:37,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:37,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:13:37,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:13:37,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:37,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:37,782 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 12:13:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534122188] [2025-03-17 12:13:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534122188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:37,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:37,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:13:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813352371] [2025-03-17 12:13:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:37,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:13:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:37,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:13:37,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:13:37,784 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:37,833 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-17 12:13:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:13:37,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:13:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:37,834 INFO L225 Difference]: With dead ends: 32 [2025-03-17 12:13:37,834 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 12:13:37,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:13:37,835 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:37,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 12:13:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-03-17 12:13:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-17 12:13:37,837 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2025-03-17 12:13:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:37,837 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-17 12:13:37,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-17 12:13:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:13:37,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:37,838 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:37,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:13:37,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:37,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1927199848, now seen corresponding path program 1 times [2025-03-17 12:13:37,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:37,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998663036] [2025-03-17 12:13:37,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:37,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:37,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:13:37,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:13:37,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:37,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:37,869 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 12:13:37,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:37,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998663036] [2025-03-17 12:13:37,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998663036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:37,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:37,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:13:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082377925] [2025-03-17 12:13:37,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:37,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:13:37,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:37,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:13:37,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:13:37,871 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:37,900 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2025-03-17 12:13:37,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:13:37,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:13:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:37,900 INFO L225 Difference]: With dead ends: 32 [2025-03-17 12:13:37,900 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 12:13:37,901 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 12:13:37,901 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:37,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 12:13:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-03-17 12:13:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-17 12:13:37,903 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2025-03-17 12:13:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:37,903 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-17 12:13:37,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-17 12:13:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 12:13:37,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:37,905 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:37,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:13:37,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:37,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:37,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1912696300, now seen corresponding path program 1 times [2025-03-17 12:13:37,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:37,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314415969] [2025-03-17 12:13:37,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:37,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:37,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:13:37,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:13:37,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:37,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:37,998 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 12:13:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314415969] [2025-03-17 12:13:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314415969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:13:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102817620] [2025-03-17 12:13:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:37,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:13:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:37,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:13:37,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:13:37,999 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:38,048 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2025-03-17 12:13:38,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:13:38,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 12:13:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:38,049 INFO L225 Difference]: With dead ends: 29 [2025-03-17 12:13:38,049 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 12:13:38,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:13:38,050 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:38,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 12:13:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2025-03-17 12:13:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-17 12:13:38,054 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2025-03-17 12:13:38,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:38,054 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-17 12:13:38,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-17 12:13:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:13:38,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:38,055 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:38,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:13:38,055 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:38,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash 145568116, now seen corresponding path program 1 times [2025-03-17 12:13:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861135724] [2025-03-17 12:13:38,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:38,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:13:38,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:13:38,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:38,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861135724] [2025-03-17 12:13:38,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861135724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:13:38,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929172963] [2025-03-17 12:13:38,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:38,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:38,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:38,291 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 12:13:38,294 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 12:13:38,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:13:38,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:13:38,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:38,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:38,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:13:38,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:38,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:13:38,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:13:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:38,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:13:38,676 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 14 treesize of output 12 [2025-03-17 12:13:38,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-17 12:13:38,705 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 14 treesize of output 12 [2025-03-17 12:13:38,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:13:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929172963] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:13:38,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:13:38,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2025-03-17 12:13:38,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361493980] [2025-03-17 12:13:38,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:13:38,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:13:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:38,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:13:38,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:13:38,762 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:38,821 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2025-03-17 12:13:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:13:38,821 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 12:13:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:38,821 INFO L225 Difference]: With dead ends: 40 [2025-03-17 12:13:38,822 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 12:13:38,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:13:38,822 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:38,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:13:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 12:13:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-17 12:13:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-03-17 12:13:38,824 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 16 [2025-03-17 12:13:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:38,824 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-03-17 12:13:38,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-03-17 12:13:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:13:38,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:38,825 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:38,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 12:13:39,028 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,SelfDestructingSolverStorable9 [2025-03-17 12:13:39,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:39,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 145568134, now seen corresponding path program 1 times [2025-03-17 12:13:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958054428] [2025-03-17 12:13:39,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:39,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:13:39,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:13:39,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:39,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 12:13:39,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 12:13:39,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:13:39,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:13:39,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:39,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 12:13:39,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 12:13:39,070 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 12:13:39,071 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2025-03-17 12:13:39,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-03-17 12:13:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-03-17 12:13:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-03-17 12:13:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-03-17 12:13:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-03-17 12:13:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2025-03-17 12:13:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-03-17 12:13:39,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-03-17 12:13:39,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2025-03-17 12:13:39,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:13:39,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:39,090 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 12:13:39,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:13:39 BoogieIcfgContainer [2025-03-17 12:13:39,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 12:13:39,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 12:13:39,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 12:13:39,095 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 12:13:39,096 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:13:36" (3/4) ... [2025-03-17 12:13:39,097 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 12:13:39,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 12:13:39,098 INFO L158 Benchmark]: Toolchain (without parser) took 2828.28ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 57.4MB in the end (delta: 71.2MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2025-03-17 12:13:39,098 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 192.9MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:13:39,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.94ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 111.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 12:13:39,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.25ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:13:39,099 INFO L158 Benchmark]: Boogie Preprocessor took 22.57ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:13:39,099 INFO L158 Benchmark]: IcfgBuilder took 275.70ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 95.7MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 12:13:39,099 INFO L158 Benchmark]: TraceAbstraction took 2188.66ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 57.4MB in the end (delta: 37.5MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2025-03-17 12:13:39,099 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 167.8MB. Free memory was 57.4MB in the beginning and 57.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:13:39,100 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.15ms. Allocated memory is still 192.9MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.94ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 111.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.25ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.57ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 275.70ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 95.7MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2188.66ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 57.4MB in the end (delta: 37.5MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 167.8MB. Free memory was 57.4MB in the beginning and 57.4MB in the end (delta: 41.6kB). 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 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={-1:0}] [L537] t->h = 1 [L538] t->n = p [L539] p = t VAL [p={-1:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 [L542] EXPR p->h [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n [L545] p = p->n [L541] COND FALSE !(p!=0) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 34 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 370 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 182 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=10, InterpolantAutomatonStates: 42, 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, 10 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 107 ConstructedInterpolants, 1 QuantifiedInterpolants, 877 SizeOfPredicates, 5 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 11/20 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 12:13:39,114 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-properties/simple_built_from_end.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:13:40,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:13:41,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 12:13:41,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:13:41,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:13:41,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:13:41,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:13:41,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:13:41,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:13:41,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:13:41,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:13:41,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:13:41,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:13:41,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:13:41,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:13:41,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:13:41,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:13:41,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:13:41,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:13:41,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:13:41,088 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:13:41,088 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:13:41,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:13:41,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:13:41,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:13:41,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:13:41,090 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2025-03-17 12:13:41,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:13:41,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:13:41,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:13:41,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:13:41,314 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:13:41,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2025-03-17 12:13:42,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e308664/bd2102aff31a456d80c6d6efa4d1d27b/FLAGc24285692 [2025-03-17 12:13:42,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:13:42,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2025-03-17 12:13:42,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e308664/bd2102aff31a456d80c6d6efa4d1d27b/FLAGc24285692 [2025-03-17 12:13:42,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e308664/bd2102aff31a456d80c6d6efa4d1d27b [2025-03-17 12:13:42,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:13:42,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:13:42,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:13:42,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:13:42,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:13:42,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:13:42" (1/1) ... [2025-03-17 12:13:42,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481f857e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:42, skipping insertion in model container [2025-03-17 12:13:42,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:13:42" (1/1) ... [2025-03-17 12:13:42,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:13:43,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:13:43,074 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:13:43,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:13:43,146 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:13:43,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43 WrapperNode [2025-03-17 12:13:43,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:13:43,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:13:43,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:13:43,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:13:43,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,184 INFO L138 Inliner]: procedures = 127, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 41 [2025-03-17 12:13:43,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:13:43,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:13:43,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:13:43,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:13:43,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,210 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 12:13:43,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:13:43,229 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:13:43,229 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:13:43,229 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:13:43,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (1/1) ... [2025-03-17 12:13:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:13:43,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:43,254 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 12:13:43,256 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 12:13:43,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 12:13:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:13:43,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:13:43,363 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:13:43,364 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:13:43,517 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L536: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 12:13:43,522 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 12:13:43,522 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:13:43,529 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:13:43,529 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:13:43,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:13:43 BoogieIcfgContainer [2025-03-17 12:13:43,530 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:13:43,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:13:43,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:13:43,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:13:43,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:13:42" (1/3) ... [2025-03-17 12:13:43,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e738cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:13:43, skipping insertion in model container [2025-03-17 12:13:43,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:13:43" (2/3) ... [2025-03-17 12:13:43,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e738cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:13:43, skipping insertion in model container [2025-03-17 12:13:43,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:13:43" (3/3) ... [2025-03-17 12:13:43,538 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2025-03-17 12:13:43,547 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:13:43,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_built_from_end.i that has 1 procedures, 29 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-03-17 12:13:43,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:13:43,582 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;@24a5d8ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:13:43,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 12:13:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:13:43,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:43,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:13:43,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:43,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1999390, now seen corresponding path program 1 times [2025-03-17 12:13:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:43,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109388527] [2025-03-17 12:13:43,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:43,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:43,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:43,606 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 12:13:43,608 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 12:13:43,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:13:43,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:13:43,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:43,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:43,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 12:13:43,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:43,688 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 12:13:43,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:13:43,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:43,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109388527] [2025-03-17 12:13:43,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109388527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:43,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:43,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:13:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985543904] [2025-03-17 12:13:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:43,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 12:13:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:43,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 12:13:43,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:13:43,714 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:43,723 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-03-17 12:13:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 12:13:43,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-17 12:13:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:43,728 INFO L225 Difference]: With dead ends: 28 [2025-03-17 12:13:43,729 INFO L226 Difference]: Without dead ends: 25 [2025-03-17 12:13:43,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:13:43,732 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:43,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-17 12:13:43,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 12:13:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2025-03-17 12:13:43,753 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 4 [2025-03-17 12:13:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:43,754 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2025-03-17 12:13:43,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2025-03-17 12:13:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:13:43,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:43,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:13:43,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 12:13:43,957 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 [2025-03-17 12:13:43,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:43,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash 61967132, now seen corresponding path program 1 times [2025-03-17 12:13:43,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:43,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084714564] [2025-03-17 12:13:43,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:43,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:43,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:43,961 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 12:13:43,962 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 12:13:44,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:13:44,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:13:44,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:44,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:44,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 12:13:44,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:44,061 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 6 treesize of output 7 [2025-03-17 12:13:44,080 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 12:13:44,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:13:44,080 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:44,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084714564] [2025-03-17 12:13:44,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084714564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:44,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:13:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816356959] [2025-03-17 12:13:44,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:44,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:13:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:44,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:13:44,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:13:44,083 INFO L87 Difference]: Start difference. First operand 25 states and 26 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 12:13:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:44,111 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-17 12:13:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:13:44,111 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 12:13:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:44,112 INFO L225 Difference]: With dead ends: 23 [2025-03-17 12:13:44,112 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 12:13:44,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:13:44,112 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 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 12:13:44,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 12:13:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 12:13:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-17 12:13:44,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2025-03-17 12:13:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:44,116 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-17 12:13:44,116 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 12:13:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-17 12:13:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:13:44,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:44,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:13:44,122 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 12:13:44,316 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 [2025-03-17 12:13:44,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:44,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash 61967133, now seen corresponding path program 1 times [2025-03-17 12:13:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219076623] [2025-03-17 12:13:44,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:44,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:44,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:44,320 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 12:13:44,320 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 12:13:44,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:13:44,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:13:44,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:44,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:44,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 12:13:44,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:44,383 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 6 treesize of output 5 [2025-03-17 12:13:44,400 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 12:13:44,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:13:44,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219076623] [2025-03-17 12:13:44,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219076623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:44,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:44,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:13:44,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050034711] [2025-03-17 12:13:44,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:44,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:13:44,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:44,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:13:44,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:13:44,401 INFO L87 Difference]: Start difference. First operand 23 states and 24 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 12:13:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:44,425 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2025-03-17 12:13:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:13:44,425 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 12:13:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:44,426 INFO L225 Difference]: With dead ends: 21 [2025-03-17 12:13:44,426 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 12:13:44,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:13:44,427 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:44,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 12:13:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 12:13:44,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-17 12:13:44,429 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 5 [2025-03-17 12:13:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:44,429 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-17 12:13:44,429 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 12:13:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-17 12:13:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:13:44,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:44,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:13:44,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:13:44,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:44,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:44,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 61965790, now seen corresponding path program 1 times [2025-03-17 12:13:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595619631] [2025-03-17 12:13:44,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:44,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:44,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:44,637 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 12:13:44,638 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 12:13:44,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:13:44,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:13:44,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:44,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:44,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 12:13:44,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:44,699 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 12:13:44,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:13:44,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595619631] [2025-03-17 12:13:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595619631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:44,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:13:44,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237359952] [2025-03-17 12:13:44,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:44,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:13:44,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:44,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:13:44,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:13:44,701 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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 12:13:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:44,729 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-03-17 12:13:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:13:44,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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 12:13:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:44,731 INFO L225 Difference]: With dead ends: 27 [2025-03-17 12:13:44,731 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 12:13:44,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:13:44,731 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:44,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 12:13:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-17 12:13:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-17 12:13:44,736 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 5 [2025-03-17 12:13:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:44,736 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-17 12:13:44,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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 12:13:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-17 12:13:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:13:44,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:44,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:13:44,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 12:13:44,937 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 [2025-03-17 12:13:44,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash 61965808, now seen corresponding path program 1 times [2025-03-17 12:13:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929751950] [2025-03-17 12:13:44,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:44,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:44,940 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 12:13:44,941 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 12:13:44,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:13:44,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:13:44,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:44,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:44,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 12:13:44,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:44,985 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 12:13:44,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:13:44,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:44,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929751950] [2025-03-17 12:13:44,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929751950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:44,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:13:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462535986] [2025-03-17 12:13:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:44,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:13:44,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:44,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:13:44,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:13:44,988 INFO L87 Difference]: Start difference. First operand 24 states and 26 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 12:13:45,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:45,009 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-03-17 12:13:45,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:13:45,009 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 12:13:45,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:45,010 INFO L225 Difference]: With dead ends: 25 [2025-03-17 12:13:45,010 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 12:13:45,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:13:45,010 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 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 12:13:45,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:45,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 12:13:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 12:13:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-17 12:13:45,012 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2025-03-17 12:13:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:45,013 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-17 12:13:45,013 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 12:13:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-17 12:13:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:13:45,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:45,013 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:45,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:13:45,213 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 [2025-03-17 12:13:45,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:45,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1927199830, now seen corresponding path program 1 times [2025-03-17 12:13:45,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:45,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462870186] [2025-03-17 12:13:45,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:45,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:45,216 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:13:45,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:13:45,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:13:45,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:13:45,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:45,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:45,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 12:13:45,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:45,285 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 12:13:45,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:13:45,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:45,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462870186] [2025-03-17 12:13:45,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462870186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:45,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:45,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:13:45,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478275327] [2025-03-17 12:13:45,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:45,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:13:45,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:45,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:13:45,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:13:45,287 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:45,360 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-17 12:13:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:13:45,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:13:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:45,361 INFO L225 Difference]: With dead ends: 27 [2025-03-17 12:13:45,361 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 12:13:45,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 12:13:45,362 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:45,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:13:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 12:13:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-17 12:13:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) 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 12:13:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-17 12:13:45,369 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2025-03-17 12:13:45,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:45,369 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-17 12:13:45,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-17 12:13:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:13:45,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:45,369 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:45,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:13:45,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:45,570 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1927199831, now seen corresponding path program 1 times [2025-03-17 12:13:45,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:45,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [24013305] [2025-03-17 12:13:45,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:45,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:45,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:45,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:13:45,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:13:45,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:13:45,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:13:45,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:45,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:45,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 12:13:45,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:45,625 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 6 treesize of output 5 [2025-03-17 12:13:45,688 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 12:13:45,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:13:45,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24013305] [2025-03-17 12:13:45,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24013305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:45,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:45,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:13:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738178743] [2025-03-17 12:13:45,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:45,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:13:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:45,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:13:45,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:13:45,690 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:45,774 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-17 12:13:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:13:45,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:13:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:45,774 INFO L225 Difference]: With dead ends: 32 [2025-03-17 12:13:45,774 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 12:13:45,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 12:13:45,775 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:45,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:13:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 12:13:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-03-17 12:13:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-17 12:13:45,777 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2025-03-17 12:13:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:45,777 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-17 12:13:45,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-17 12:13:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:13:45,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:45,777 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:45,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:13:45,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:45,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:45,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1927199848, now seen corresponding path program 1 times [2025-03-17 12:13:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:45,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592431947] [2025-03-17 12:13:45,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:45,996 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:13:45,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:13:46,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:13:46,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:13:46,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:46,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:46,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 12:13:46,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:46,056 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 12:13:46,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:13:46,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:46,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592431947] [2025-03-17 12:13:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592431947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:46,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:46,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:13:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078540860] [2025-03-17 12:13:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:46,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:13:46,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:46,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:13:46,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:13:46,057 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:46,103 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2025-03-17 12:13:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:13:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:13:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:46,104 INFO L225 Difference]: With dead ends: 32 [2025-03-17 12:13:46,104 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 12:13:46,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 12:13:46,105 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:46,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:13:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 12:13:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-03-17 12:13:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-17 12:13:46,107 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2025-03-17 12:13:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:46,107 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-17 12:13:46,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-17 12:13:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 12:13:46,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:46,107 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:46,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 12:13:46,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:46,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:46,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1912696300, now seen corresponding path program 1 times [2025-03-17 12:13:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:46,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82872809] [2025-03-17 12:13:46,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:46,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:46,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:46,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:13:46,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:13:46,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:13:46,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:13:46,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:46,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:46,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 12:13:46,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:46,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:13:46,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 11 [2025-03-17 12:13:46,402 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 12:13:46,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:13:46,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:46,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82872809] [2025-03-17 12:13:46,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82872809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:13:46,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:13:46,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:13:46,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642166765] [2025-03-17 12:13:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:13:46,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:13:46,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:46,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:13:46,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:13:46,404 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:46,485 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2025-03-17 12:13:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:13:46,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 12:13:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:46,486 INFO L225 Difference]: With dead ends: 29 [2025-03-17 12:13:46,486 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 12:13:46,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:13:46,487 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:46,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:13:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 12:13:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2025-03-17 12:13:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-17 12:13:46,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2025-03-17 12:13:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:46,488 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-17 12:13:46,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-17 12:13:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:13:46,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:46,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:46,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 12:13:46,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:46,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:46,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash 145568116, now seen corresponding path program 1 times [2025-03-17 12:13:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92459333] [2025-03-17 12:13:46,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:46,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:46,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:46,692 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:13:46,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:13:46,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:13:46,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:13:46,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:46,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:46,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 12:13:46,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:46,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:13:46,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:13:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:46,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:13:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:47,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:13:47,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92459333] [2025-03-17 12:13:47,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92459333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:13:47,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:13:47,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2025-03-17 12:13:47,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546918361] [2025-03-17 12:13:47,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:13:47,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:13:47,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:13:47,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:13:47,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:13:47,005 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 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 12:13:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:47,117 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2025-03-17 12:13:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:13:47,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 12:13:47,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:47,119 INFO L225 Difference]: With dead ends: 40 [2025-03-17 12:13:47,119 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 12:13:47,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:13:47,119 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:47,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:13:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 12:13:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-17 12:13:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-03-17 12:13:47,124 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 16 [2025-03-17 12:13:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:47,124 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-03-17 12:13:47,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 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 12:13:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-03-17 12:13:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:13:47,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:47,124 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:47,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 12:13:47,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:47,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-17 12:13:47,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash 145568134, now seen corresponding path program 1 times [2025-03-17 12:13:47,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:13:47,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776761947] [2025-03-17 12:13:47,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:47,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:47,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:47,329 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:13:47,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:13:47,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:13:47,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:13:47,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:47,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 12:13:47,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 12:13:47,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:13:47,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:13:47,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:47,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 12:13:47,425 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 12:13:47,425 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 12:13:47,426 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2025-03-17 12:13:47,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-03-17 12:13:47,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-03-17 12:13:47,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-03-17 12:13:47,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-03-17 12:13:47,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-03-17 12:13:47,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2025-03-17 12:13:47,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-03-17 12:13:47,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-03-17 12:13:47,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2025-03-17 12:13:47,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 12:13:47,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:47,631 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:47,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 12:13:47,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:13:47 BoogieIcfgContainer [2025-03-17 12:13:47,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 12:13:47,643 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 12:13:47,643 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 12:13:47,643 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 12:13:47,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:13:43" (3/4) ... [2025-03-17 12:13:47,646 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 12:13:47,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 12:13:47,647 INFO L158 Benchmark]: Toolchain (without parser) took 4835.41ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 52.6MB in the end (delta: 39.0MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-03-17 12:13:47,647 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:13:47,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.44ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 12:13:47,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 72.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:13:47,647 INFO L158 Benchmark]: Boogie Preprocessor took 42.52ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 70.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:13:47,648 INFO L158 Benchmark]: IcfgBuilder took 301.31ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 56.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:13:47,648 INFO L158 Benchmark]: TraceAbstraction took 4111.56ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 52.7MB in the end (delta: 3.2MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2025-03-17 12:13:47,648 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 117.4MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 12.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:13:47,649 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.82ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.44ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 72.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.52ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 70.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 301.31ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 56.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4111.56ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 52.7MB in the end (delta: 3.2MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 117.4MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 12.9kB). 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 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={3:0}] [L537] t->h = 1 [L538] t->n = p [L539] p = t VAL [p={3:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 [L542] EXPR p->h [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n [L545] p = p->n [L541] COND FALSE !(p!=0) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 34 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 370 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 182 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=10, InterpolantAutomatonStates: 42, 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, 10 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 643 SizeOfPredicates, 5 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 10/16 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 12:13:47,660 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: UNKNOWN: Overapproximated counterexample