./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:52:07,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:52:07,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:52:07,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:52:07,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:52:07,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:52:07,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:52:07,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:52:07,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:52:07,782 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:52:07,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:52:07,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:52:07,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:52:07,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:52:07,783 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:52:07,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:52:07,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:52:07,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:52:07,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:52:07,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:52:07,783 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:52:07,783 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:52:07,783 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:52:07,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:52:07,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:07,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:52:07,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:52:07,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:52:07,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:52:07,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:52:07,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:52:07,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:52:07,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:52:07,785 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2025-03-04 07:52:07,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:52:08,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:52:08,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:52:08,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:52:08,004 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:52:08,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2025-03-04 07:52:09,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d514d266b/a1baf624a94e448e9a9528206de7a5ac/FLAGc536105bb [2025-03-04 07:52:09,459 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:52:09,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2025-03-04 07:52:09,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d514d266b/a1baf624a94e448e9a9528206de7a5ac/FLAGc536105bb [2025-03-04 07:52:09,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d514d266b/a1baf624a94e448e9a9528206de7a5ac [2025-03-04 07:52:09,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:52:09,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:52:09,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:09,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:52:09,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:52:09,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:09" (1/1) ... [2025-03-04 07:52:09,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:09, skipping insertion in model container [2025-03-04 07:52:09,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:09" (1/1) ... [2025-03-04 07:52:09,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:52:09,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:09,953 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:52:09,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:10,010 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:52:10,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10 WrapperNode [2025-03-04 07:52:10,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:10,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:10,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:52:10,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:52:10,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,038 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2025-03-04 07:52:10,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:10,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:52:10,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:52:10,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:52:10,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,070 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2025-03-04 07:52:10,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:52:10,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:52:10,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:52:10,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:52:10,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (1/1) ... [2025-03-04 07:52:10,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:10,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:10,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:52:10,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:52:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:52:10,140 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:52:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:52:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:52:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:52:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:52:10,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:52:10,225 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:52:10,226 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:52:10,501 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-04 07:52:10,501 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:52:10,509 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:52:10,509 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:52:10,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:10 BoogieIcfgContainer [2025-03-04 07:52:10,510 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:52:10,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:52:10,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:52:10,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:52:10,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:52:09" (1/3) ... [2025-03-04 07:52:10,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59882ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:10, skipping insertion in model container [2025-03-04 07:52:10,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:10" (2/3) ... [2025-03-04 07:52:10,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59882ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:10, skipping insertion in model container [2025-03-04 07:52:10,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:10" (3/3) ... [2025-03-04 07:52:10,520 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2025-03-04 07:52:10,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:52:10,531 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-2.i that has 2 procedures, 142 locations, 1 initial locations, 6 loop locations, and 63 error locations. [2025-03-04 07:52:10,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:52:10,570 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;@1e479d6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:52:10,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-03-04 07:52:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 74 states have (on average 2.081081081081081) internal successors, (154), 137 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:52:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:10,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:10,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:10,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:10,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash 186651, now seen corresponding path program 1 times [2025-03-04 07:52:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:10,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828591664] [2025-03-04 07:52:10,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:10,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:10,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:10,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:10,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:10,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:10,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828591664] [2025-03-04 07:52:10,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828591664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:10,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:10,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:10,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448910427] [2025-03-04 07:52:10,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:10,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:10,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:10,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:10,773 INFO L87 Difference]: Start difference. First operand has 142 states, 74 states have (on average 2.081081081081081) internal successors, (154), 137 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:10,906 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-03-04 07:52:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:10,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-04 07:52:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:10,912 INFO L225 Difference]: With dead ends: 132 [2025-03-04 07:52:10,912 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 07:52:10,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:10,915 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 103 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:10,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 83 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 07:52:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-04 07:52:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2025-03-04 07:52:10,961 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 3 [2025-03-04 07:52:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:10,961 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2025-03-04 07:52:10,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2025-03-04 07:52:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:10,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:10,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:10,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:52:10,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:10,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:10,966 INFO L85 PathProgramCache]: Analyzing trace with hash 186652, now seen corresponding path program 1 times [2025-03-04 07:52:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:10,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-03-04 07:52:10,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:10,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:10,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:10,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:10,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-03-04 07:52:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72362284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684944187] [2025-03-04 07:52:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:11,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:11,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:11,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:11,045 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:11,171 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2025-03-04 07:52:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-04 07:52:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:11,173 INFO L225 Difference]: With dead ends: 134 [2025-03-04 07:52:11,173 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 07:52:11,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:11,174 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 97 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:11,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 94 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 07:52:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-04 07:52:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 78 states have (on average 1.794871794871795) internal successors, (140), 132 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2025-03-04 07:52:11,182 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 3 [2025-03-04 07:52:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:11,183 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2025-03-04 07:52:11,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2025-03-04 07:52:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:52:11,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:11,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:11,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:52:11,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:11,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash 137658064, now seen corresponding path program 1 times [2025-03-04 07:52:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070714640] [2025-03-04 07:52:11,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:11,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:52:11,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:52:11,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:11,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:11,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070714640] [2025-03-04 07:52:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070714640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:11,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:11,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015718351] [2025-03-04 07:52:11,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:11,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:11,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:11,386 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:11,519 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2025-03-04 07:52:11,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:11,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:52:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:11,520 INFO L225 Difference]: With dead ends: 124 [2025-03-04 07:52:11,521 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 07:52:11,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:11,522 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 134 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:11,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 66 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 07:52:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-04 07:52:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.6419753086419753) internal successors, (133), 122 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2025-03-04 07:52:11,530 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 9 [2025-03-04 07:52:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:11,530 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2025-03-04 07:52:11,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2025-03-04 07:52:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:52:11,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:11,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:11,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:52:11,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:11,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash 137658065, now seen corresponding path program 1 times [2025-03-04 07:52:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468588152] [2025-03-04 07:52:11,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:11,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:52:11,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:52:11,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:11,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:11,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:11,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468588152] [2025-03-04 07:52:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468588152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:11,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941844883] [2025-03-04 07:52:11,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:11,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:11,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:11,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:11,683 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:11,833 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2025-03-04 07:52:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:11,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:52:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:11,834 INFO L225 Difference]: With dead ends: 141 [2025-03-04 07:52:11,834 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 07:52:11,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:11,834 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 126 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:11,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 106 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 07:52:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-04 07:52:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.5789473684210527) internal successors, (150), 135 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2025-03-04 07:52:11,842 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 9 [2025-03-04 07:52:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:11,842 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2025-03-04 07:52:11,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2025-03-04 07:52:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:52:11,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:11,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:11,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:52:11,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:11,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:11,846 INFO L85 PathProgramCache]: Analyzing trace with hash -722276904, now seen corresponding path program 1 times [2025-03-04 07:52:11,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:11,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416631200] [2025-03-04 07:52:11,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:11,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:11,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:52:11,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:52:11,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:11,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:11,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416631200] [2025-03-04 07:52:11,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416631200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:11,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:11,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:11,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084028873] [2025-03-04 07:52:11,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:11,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:11,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:11,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:11,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:11,956 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:12,071 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2025-03-04 07:52:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:12,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:52:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:12,071 INFO L225 Difference]: With dead ends: 136 [2025-03-04 07:52:12,071 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 07:52:12,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:12,072 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 4 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:12,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 289 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 07:52:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 07:52:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 95 states have (on average 1.5578947368421052) internal successors, (148), 134 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2025-03-04 07:52:12,079 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 12 [2025-03-04 07:52:12,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:12,079 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2025-03-04 07:52:12,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2025-03-04 07:52:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:52:12,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:12,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:12,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:52:12,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:12,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash -722276903, now seen corresponding path program 1 times [2025-03-04 07:52:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:12,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927490027] [2025-03-04 07:52:12,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:12,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:12,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:52:12,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:52:12,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:12,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927490027] [2025-03-04 07:52:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927490027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:12,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399915263] [2025-03-04 07:52:12,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:12,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:12,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:12,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:12,221 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:12,350 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-03-04 07:52:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:12,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:52:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:12,352 INFO L225 Difference]: With dead ends: 135 [2025-03-04 07:52:12,352 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 07:52:12,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:12,353 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:12,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 278 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 07:52:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-04 07:52:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.5368421052631578) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2025-03-04 07:52:12,361 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 12 [2025-03-04 07:52:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:12,362 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2025-03-04 07:52:12,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2025-03-04 07:52:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:52:12,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:12,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:12,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:52:12,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:12,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash -989217109, now seen corresponding path program 1 times [2025-03-04 07:52:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812101886] [2025-03-04 07:52:12,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:12,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:12,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:52:12,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:52:12,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:12,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812101886] [2025-03-04 07:52:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812101886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:12,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:12,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137005938] [2025-03-04 07:52:12,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:12,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:12,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:12,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:12,396 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:12,484 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2025-03-04 07:52:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:12,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:52:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:12,485 INFO L225 Difference]: With dead ends: 140 [2025-03-04 07:52:12,485 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 07:52:12,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:12,486 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 121 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:12,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 07:52:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2025-03-04 07:52:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2025-03-04 07:52:12,489 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 13 [2025-03-04 07:52:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:12,490 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2025-03-04 07:52:12,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2025-03-04 07:52:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:12,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:12,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:12,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:52:12,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:12,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash 998052485, now seen corresponding path program 1 times [2025-03-04 07:52:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:12,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211908299] [2025-03-04 07:52:12,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:12,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:12,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:12,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:12,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:12,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:12,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211908299] [2025-03-04 07:52:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211908299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:12,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:12,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:52:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395159232] [2025-03-04 07:52:12,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:12,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:12,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:12,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:12,606 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:12,763 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2025-03-04 07:52:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:52:12,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:52:12,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:12,765 INFO L225 Difference]: With dead ends: 180 [2025-03-04 07:52:12,765 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 07:52:12,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:12,766 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:12,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 317 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:12,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 07:52:12,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 139. [2025-03-04 07:52:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.48) internal successors, (148), 137 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2025-03-04 07:52:12,770 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 16 [2025-03-04 07:52:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:12,771 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2025-03-04 07:52:12,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2025-03-04 07:52:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:12,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:12,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:12,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:52:12,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:12,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash 600256274, now seen corresponding path program 1 times [2025-03-04 07:52:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:12,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116298231] [2025-03-04 07:52:12,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:12,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:12,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:12,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:12,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:12,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:12,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116298231] [2025-03-04 07:52:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116298231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698821941] [2025-03-04 07:52:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:52:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:12,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:52:12,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:12,943 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:13,189 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2025-03-04 07:52:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:52:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:52:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:13,190 INFO L225 Difference]: With dead ends: 138 [2025-03-04 07:52:13,190 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 07:52:13,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:52:13,191 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 126 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:13,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 171 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 07:52:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 07:52:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 100 states have (on average 1.47) internal successors, (147), 136 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2025-03-04 07:52:13,194 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 16 [2025-03-04 07:52:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:13,195 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2025-03-04 07:52:13,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2025-03-04 07:52:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:13,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:13,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:13,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:52:13,196 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:13,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash 600256275, now seen corresponding path program 1 times [2025-03-04 07:52:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:13,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149463212] [2025-03-04 07:52:13,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:13,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:13,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:13,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:13,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:13,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:13,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149463212] [2025-03-04 07:52:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149463212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:13,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:52:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273794913] [2025-03-04 07:52:13,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:13,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:52:13,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:13,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:52:13,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:52:13,435 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:13,825 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2025-03-04 07:52:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:52:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:52:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:13,826 INFO L225 Difference]: With dead ends: 141 [2025-03-04 07:52:13,826 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 07:52:13,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:52:13,826 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 139 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:13,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 245 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 07:52:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2025-03-04 07:52:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 102 states have (on average 1.411764705882353) internal successors, (144), 132 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-03-04 07:52:13,829 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 16 [2025-03-04 07:52:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:13,830 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-03-04 07:52:13,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-03-04 07:52:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:52:13,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:13,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:13,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:52:13,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:13,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash 557146087, now seen corresponding path program 1 times [2025-03-04 07:52:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041368720] [2025-03-04 07:52:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:13,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:52:13,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:52:13,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:13,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:13,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:13,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041368720] [2025-03-04 07:52:13,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041368720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:13,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:13,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858980362] [2025-03-04 07:52:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:13,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:13,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:13,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:13,874 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:13,975 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2025-03-04 07:52:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:13,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:52:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:13,976 INFO L225 Difference]: With dead ends: 138 [2025-03-04 07:52:13,976 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 07:52:13,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:13,977 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:13,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 07:52:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2025-03-04 07:52:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 131 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2025-03-04 07:52:13,979 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 20 [2025-03-04 07:52:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:13,979 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2025-03-04 07:52:13,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2025-03-04 07:52:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:52:13,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:13,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:13,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:52:13,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:13,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1433407608, now seen corresponding path program 1 times [2025-03-04 07:52:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:13,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-04 07:52:13,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:13,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:52:13,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:52:13,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:13,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:52:13,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:52:13,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:52:13,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:52:13,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:13,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:52:14,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:52:14,011 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:52:14,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (62 of 63 remaining) [2025-03-04 07:52:14,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (61 of 63 remaining) [2025-03-04 07:52:14,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (60 of 63 remaining) [2025-03-04 07:52:14,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (59 of 63 remaining) [2025-03-04 07:52:14,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (58 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (55 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (54 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (53 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (50 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (49 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (48 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 63 remaining) [2025-03-04 07:52:14,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 63 remaining) [2025-03-04 07:52:14,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 63 remaining) [2025-03-04 07:52:14,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 63 remaining) [2025-03-04 07:52:14,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 63 remaining) [2025-03-04 07:52:14,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 63 remaining) [2025-03-04 07:52:14,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 63 remaining) [2025-03-04 07:52:14,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 63 remaining) [2025-03-04 07:52:14,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 63 remaining) [2025-03-04 07:52:14,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:52:14,022 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:14,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:52:14,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:52:14 BoogieIcfgContainer [2025-03-04 07:52:14,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:52:14,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:52:14,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:52:14,041 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:52:14,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:10" (3/4) ... [2025-03-04 07:52:14,043 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:52:14,044 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:52:14,045 INFO L158 Benchmark]: Toolchain (without parser) took 4311.87ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 76.4MB in the end (delta: 43.4MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2025-03-04 07:52:14,045 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:14,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.97ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 102.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:52:14,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.18ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:14,046 INFO L158 Benchmark]: Boogie Preprocessor took 50.29ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:52:14,046 INFO L158 Benchmark]: IcfgBuilder took 419.84ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 73.0MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 07:52:14,046 INFO L158 Benchmark]: TraceAbstraction took 3528.96ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 76.4MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:14,047 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 76.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:14,048 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 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.97ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 102.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.18ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.29ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 419.84ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 73.0MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3528.96ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 76.4MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 76.4MB in the end (delta: 50.8kB). 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: 991]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 991. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) [L1007] list->prev = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND TRUE __VERIFIER_nondet_int() [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={-1:0}, list={-1:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1040] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1041] EXPR end->colour [L1041] COND FALSE !(!(BLACK == end->colour)) [L1041] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1043] COND TRUE ((void*)0) != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next [L1051] COND TRUE !(end->next) [L1051] CALL reach_error() [L991] COND FALSE !(0) [L991] __assert_fail ("0", "dll-rb-cnstr_1-2.c", 11, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free 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: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free 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: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free 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. - 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. - 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. - 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. - 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. - 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. - 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. - 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. - 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 2 procedures, 142 locations, 63 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1010 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1010 mSDsluCounter, 2093 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1214 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2152 IncrementalHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 879 mSDtfsCounter, 2152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=0, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 63 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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-04 07:52:14,065 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/forester-heap/dll-rb-cnstr_1-2.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 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:52:15,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:52:15,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:52:16,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:52:16,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:52:16,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:52:16,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:52:16,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:52:16,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:52:16,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:52:16,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:52:16,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:52:16,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:52:16,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:52:16,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:52:16,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:52:16,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:52:16,034 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:52:16,035 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:52:16,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:52:16,035 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:52:16,035 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:52:16,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:52:16,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:52:16,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:52:16,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:52:16,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:16,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:52:16,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:52:16,036 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:52:16,036 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:52:16,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:52:16,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:52:16,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:52:16,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:52:16,037 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2025-03-04 07:52:16,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:52:16,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:52:16,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:52:16,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:52:16,298 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:52:16,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2025-03-04 07:52:17,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f6fc7ae/00753eb5a48c43099b7e38fc110b54b6/FLAG2c5493224 [2025-03-04 07:52:17,731 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:52:17,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2025-03-04 07:52:17,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f6fc7ae/00753eb5a48c43099b7e38fc110b54b6/FLAG2c5493224 [2025-03-04 07:52:18,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f6fc7ae/00753eb5a48c43099b7e38fc110b54b6 [2025-03-04 07:52:18,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:52:18,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:52:18,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:18,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:52:18,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:52:18,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70acd32c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18, skipping insertion in model container [2025-03-04 07:52:18,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:52:18,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:18,318 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:52:18,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:18,387 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:52:18,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18 WrapperNode [2025-03-04 07:52:18,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:18,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:18,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:52:18,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:52:18,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,417 INFO L138 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2025-03-04 07:52:18,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:18,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:52:18,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:52:18,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:52:18,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,438 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2025-03-04 07:52:18,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:52:18,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:52:18,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:52:18,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:52:18,462 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (1/1) ... [2025-03-04 07:52:18,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:18,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:18,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:52:18,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:52:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:52:18,507 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:52:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:52:18,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:52:18,597 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:52:18,598 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:52:19,098 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-04 07:52:19,098 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:52:19,112 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:52:19,112 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:52:19,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:19 BoogieIcfgContainer [2025-03-04 07:52:19,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:52:19,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:52:19,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:52:19,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:52:19,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:52:18" (1/3) ... [2025-03-04 07:52:19,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d71194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:19, skipping insertion in model container [2025-03-04 07:52:19,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:18" (2/3) ... [2025-03-04 07:52:19,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d71194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:19, skipping insertion in model container [2025-03-04 07:52:19,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:19" (3/3) ... [2025-03-04 07:52:19,118 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2025-03-04 07:52:19,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:52:19,127 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-2.i that has 2 procedures, 142 locations, 1 initial locations, 6 loop locations, and 63 error locations. [2025-03-04 07:52:19,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:52:19,156 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;@3594f715, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:52:19,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-03-04 07:52:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 74 states have (on average 2.081081081081081) internal successors, (154), 137 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:52:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:19,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:19,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:19,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:19,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 186651, now seen corresponding path program 1 times [2025-03-04 07:52:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:19,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017471116] [2025-03-04 07:52:19,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:19,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:19,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:19,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:19,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:52:19,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:19,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:19,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:19,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:19,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:52:19,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:19,262 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-04 07:52:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:19,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:19,277 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017471116] [2025-03-04 07:52:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017471116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:19,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:19,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:19,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219395464] [2025-03-04 07:52:19,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:19,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:19,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:19,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:19,297 INFO L87 Difference]: Start difference. First operand has 142 states, 74 states have (on average 2.081081081081081) internal successors, (154), 137 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:19,498 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-03-04 07:52:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-04 07:52:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:19,505 INFO L225 Difference]: With dead ends: 132 [2025-03-04 07:52:19,505 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 07:52:19,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:19,511 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 103 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:19,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 83 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 07:52:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-04 07:52:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2025-03-04 07:52:19,543 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 3 [2025-03-04 07:52:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:19,543 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2025-03-04 07:52:19,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2025-03-04 07:52:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:19,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:19,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:19,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:52:19,744 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-04 07:52:19,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:19,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:19,745 INFO L85 PathProgramCache]: Analyzing trace with hash 186652, now seen corresponding path program 1 times [2025-03-04 07:52:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:19,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049830771] [2025-03-04 07:52:19,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:19,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:19,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:19,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:52:19,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:19,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:19,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:19,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:19,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:52:19,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:19,808 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-04 07:52:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:19,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:19,823 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049830771] [2025-03-04 07:52:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049830771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:19,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:19,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748349418] [2025-03-04 07:52:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:19,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:19,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:19,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:19,825 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:20,045 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2025-03-04 07:52:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:20,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-04 07:52:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:20,047 INFO L225 Difference]: With dead ends: 134 [2025-03-04 07:52:20,047 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 07:52:20,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:20,048 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 97 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:20,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 94 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 07:52:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-04 07:52:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 78 states have (on average 1.794871794871795) internal successors, (140), 132 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2025-03-04 07:52:20,054 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 3 [2025-03-04 07:52:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:20,054 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2025-03-04 07:52:20,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2025-03-04 07:52:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:52:20,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:20,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:20,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:52:20,255 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-04 07:52:20,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:20,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 137658064, now seen corresponding path program 1 times [2025-03-04 07:52:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984001199] [2025-03-04 07:52:20,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:20,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:20,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:20,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:52:20,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:52:20,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:52:20,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:20,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:20,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:52:20,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:20,364 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:52:20,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:52:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:20,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:20,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:20,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984001199] [2025-03-04 07:52:20,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984001199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:20,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:20,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137305798] [2025-03-04 07:52:20,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:20,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:20,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:20,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:20,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:20,382 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:20,641 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2025-03-04 07:52:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:52:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:20,642 INFO L225 Difference]: With dead ends: 124 [2025-03-04 07:52:20,642 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 07:52:20,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:20,643 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 134 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:20,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 66 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 07:52:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-04 07:52:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.6419753086419753) internal successors, (133), 122 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2025-03-04 07:52:20,648 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 9 [2025-03-04 07:52:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:20,648 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2025-03-04 07:52:20,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2025-03-04 07:52:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:52:20,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:20,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:20,659 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-04 07:52:20,852 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-04 07:52:20,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:20,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:20,853 INFO L85 PathProgramCache]: Analyzing trace with hash 137658065, now seen corresponding path program 1 times [2025-03-04 07:52:20,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:20,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637409063] [2025-03-04 07:52:20,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:20,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:20,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:20,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:20,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:52:20,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:52:20,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:52:20,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:20,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:20,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:52:20,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:20,920 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-04 07:52:21,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:52:21,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:52:21,024 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:52:21,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:52:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:21,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:21,036 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:21,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637409063] [2025-03-04 07:52:21,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637409063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:21,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:21,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:21,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580630350] [2025-03-04 07:52:21,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:21,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:21,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:21,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:21,037 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:21,424 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2025-03-04 07:52:21,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:21,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:52:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:21,425 INFO L225 Difference]: With dead ends: 141 [2025-03-04 07:52:21,426 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 07:52:21,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:52:21,426 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 229 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:21,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 122 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:52:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 07:52:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-04 07:52:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.5789473684210527) internal successors, (150), 135 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2025-03-04 07:52:21,431 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 9 [2025-03-04 07:52:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:21,432 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2025-03-04 07:52:21,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2025-03-04 07:52:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:52:21,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:21,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:21,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:21,633 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-04 07:52:21,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:21,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:21,633 INFO L85 PathProgramCache]: Analyzing trace with hash -722276904, now seen corresponding path program 1 times [2025-03-04 07:52:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:21,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369533694] [2025-03-04 07:52:21,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:21,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:21,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:21,636 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:21,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:52:21,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:52:21,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:52:21,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:21,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:21,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:52:21,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:21,698 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-04 07:52:21,715 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 15 treesize of output 1 [2025-03-04 07:52:21,731 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 19 treesize of output 11 [2025-03-04 07:52:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:21,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:21,739 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369533694] [2025-03-04 07:52:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369533694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:21,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:21,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588392652] [2025-03-04 07:52:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:21,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:21,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:21,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:21,740 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:21,980 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2025-03-04 07:52:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:21,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:52:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:21,981 INFO L225 Difference]: With dead ends: 136 [2025-03-04 07:52:21,981 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 07:52:21,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:21,982 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 4 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:21,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 289 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 07:52:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 07:52:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 95 states have (on average 1.5578947368421052) internal successors, (148), 134 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2025-03-04 07:52:21,987 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 12 [2025-03-04 07:52:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:21,987 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2025-03-04 07:52:21,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2025-03-04 07:52:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:52:21,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:21,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:21,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:22,187 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-04 07:52:22,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:22,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash -722276903, now seen corresponding path program 1 times [2025-03-04 07:52:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516681878] [2025-03-04 07:52:22,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:22,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:22,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:22,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:22,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:52:22,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:52:22,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:52:22,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:22,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:22,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:52:22,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:22,260 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-04 07:52:22,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:22,284 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 15 treesize of output 1 [2025-03-04 07:52:22,311 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 17 treesize of output 9 [2025-03-04 07:52:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:22,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:22,322 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516681878] [2025-03-04 07:52:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516681878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:22,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:22,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445505371] [2025-03-04 07:52:22,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:22,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:22,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:22,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:22,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:22,323 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:22,619 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-03-04 07:52:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:22,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:52:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:22,620 INFO L225 Difference]: With dead ends: 135 [2025-03-04 07:52:22,620 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 07:52:22,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:22,620 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:22,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 278 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 07:52:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-04 07:52:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.5368421052631578) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2025-03-04 07:52:22,625 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 12 [2025-03-04 07:52:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:22,625 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2025-03-04 07:52:22,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2025-03-04 07:52:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:52:22,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:22,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:22,632 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-04 07:52:22,826 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-04 07:52:22,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:22,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:22,827 INFO L85 PathProgramCache]: Analyzing trace with hash -989217109, now seen corresponding path program 1 times [2025-03-04 07:52:22,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:22,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444855396] [2025-03-04 07:52:22,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:22,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:22,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:22,830 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:22,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:52:22,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:52:22,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:52:22,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:22,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:22,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:52:22,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:22,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:22,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:22,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444855396] [2025-03-04 07:52:22,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444855396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:22,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:22,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119920395] [2025-03-04 07:52:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:22,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:22,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:22,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:22,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:22,918 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:23,119 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2025-03-04 07:52:23,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:23,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:52:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:23,120 INFO L225 Difference]: With dead ends: 140 [2025-03-04 07:52:23,120 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 07:52:23,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:23,121 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 121 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:23,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 07:52:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2025-03-04 07:52:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2025-03-04 07:52:23,125 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 13 [2025-03-04 07:52:23,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:23,125 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2025-03-04 07:52:23,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2025-03-04 07:52:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:23,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:23,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:23,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:52:23,327 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-04 07:52:23,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:23,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash 998052485, now seen corresponding path program 1 times [2025-03-04 07:52:23,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:23,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245398395] [2025-03-04 07:52:23,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:23,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:23,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:23,330 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:23,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:52:23,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:23,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:23,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:23,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:23,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:52:23,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:23,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:23,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:23,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:23,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245398395] [2025-03-04 07:52:23,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245398395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:23,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:52:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541418334] [2025-03-04 07:52:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:23,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:23,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:23,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:23,451 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:23,731 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2025-03-04 07:52:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:52:23,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:52:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:23,733 INFO L225 Difference]: With dead ends: 180 [2025-03-04 07:52:23,733 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 07:52:23,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:23,733 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 197 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:23,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 311 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 07:52:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 139. [2025-03-04 07:52:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.48) internal successors, (148), 137 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2025-03-04 07:52:23,736 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 16 [2025-03-04 07:52:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:23,736 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2025-03-04 07:52:23,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2025-03-04 07:52:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:23,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:23,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:23,747 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-04 07:52:23,937 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-04 07:52:23,937 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:23,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 600256274, now seen corresponding path program 1 times [2025-03-04 07:52:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391635791] [2025-03-04 07:52:23,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:23,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:23,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:23,940 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:23,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:52:23,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:23,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:23,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:23,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:23,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:52:23,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:24,025 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-04 07:52:24,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-03-04 07:52:24,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:24,126 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:24,126 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-04 07:52:24,152 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 27 treesize of output 15 [2025-03-04 07:52:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:24,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:24,206 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:24,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391635791] [2025-03-04 07:52:24,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391635791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:24,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:24,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:24,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573908507] [2025-03-04 07:52:24,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:24,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:52:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:24,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:52:24,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:24,207 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:24,785 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2025-03-04 07:52:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:52:24,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:52:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:24,786 INFO L225 Difference]: With dead ends: 156 [2025-03-04 07:52:24,786 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 07:52:24,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:52:24,786 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 150 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:24,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 222 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:52:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 07:52:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2025-03-04 07:52:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 100 states have (on average 1.47) internal successors, (147), 136 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2025-03-04 07:52:24,789 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 16 [2025-03-04 07:52:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:24,789 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2025-03-04 07:52:24,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2025-03-04 07:52:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:24,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:24,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:24,798 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-04 07:52:24,990 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-04 07:52:24,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:24,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash 600256275, now seen corresponding path program 1 times [2025-03-04 07:52:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:24,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742762673] [2025-03-04 07:52:24,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:24,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:24,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:24,994 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:24,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:52:25,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:25,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:25,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:25,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:25,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:52:25,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:25,090 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-04 07:52:25,099 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:52:25,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:52:25,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:25,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:25,203 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:25,203 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:52:25,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:52:25,246 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 25 treesize of output 13 [2025-03-04 07:52:25,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:52:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:25,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:25,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:25,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742762673] [2025-03-04 07:52:25,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742762673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:25,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:25,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717973521] [2025-03-04 07:52:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:25,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:52:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:25,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:52:25,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:25,282 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:25,939 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2025-03-04 07:52:25,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:52:25,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:52:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:25,940 INFO L225 Difference]: With dead ends: 141 [2025-03-04 07:52:25,940 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 07:52:25,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:52:25,941 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 137 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:25,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 213 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:52:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 07:52:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2025-03-04 07:52:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 102 states have (on average 1.411764705882353) internal successors, (144), 132 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-03-04 07:52:25,943 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 16 [2025-03-04 07:52:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:25,943 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-03-04 07:52:25,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-03-04 07:52:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:52:25,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:25,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:25,954 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-04 07:52:26,144 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-04 07:52:26,145 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:26,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash 557146087, now seen corresponding path program 1 times [2025-03-04 07:52:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:26,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416439180] [2025-03-04 07:52:26,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:26,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:26,147 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:52:26,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:52:26,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:52:26,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:26,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:26,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:52:26,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:26,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:26,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:26,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416439180] [2025-03-04 07:52:26,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416439180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:26,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:26,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823861986] [2025-03-04 07:52:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:26,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:26,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:26,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:26,235 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:26,468 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2025-03-04 07:52:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:26,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:52:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:26,469 INFO L225 Difference]: With dead ends: 138 [2025-03-04 07:52:26,469 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 07:52:26,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:26,470 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:26,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 07:52:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2025-03-04 07:52:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 131 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2025-03-04 07:52:26,472 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 20 [2025-03-04 07:52:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:26,472 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2025-03-04 07:52:26,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2025-03-04 07:52:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:52:26,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:26,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:26,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:52:26,673 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-04 07:52:26,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 60 more)] === [2025-03-04 07:52:26,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1433407608, now seen corresponding path program 1 times [2025-03-04 07:52:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:26,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128418854] [2025-03-04 07:52:26,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:26,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:26,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:26,676 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:26,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:52:26,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:52:26,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:52:26,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:26,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:52:26,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:52:26,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:52:27,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:52:27,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:27,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:52:27,030 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 07:52:27,030 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:52:27,030 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (62 of 63 remaining) [2025-03-04 07:52:27,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (61 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (60 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (59 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (58 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (55 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (54 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (53 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (50 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (49 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (48 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 63 remaining) [2025-03-04 07:52:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 63 remaining) [2025-03-04 07:52:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 63 remaining) [2025-03-04 07:52:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 63 remaining) [2025-03-04 07:52:27,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:52:27,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:27,237 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:27,248 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:52:27,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:52:27 BoogieIcfgContainer [2025-03-04 07:52:27,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:52:27,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:52:27,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:52:27,251 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:52:27,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:19" (3/4) ... [2025-03-04 07:52:27,253 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:52:27,254 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:52:27,254 INFO L158 Benchmark]: Toolchain (without parser) took 9188.31ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 15.7MB in the end (delta: 43.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2025-03-04 07:52:27,254 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:27,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.55ms. Allocated memory is still 83.9MB. Free memory was 58.4MB in the beginning and 40.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:52:27,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.84ms. Allocated memory is still 83.9MB. Free memory was 40.4MB in the beginning and 38.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:27,255 INFO L158 Benchmark]: Boogie Preprocessor took 41.93ms. Allocated memory is still 83.9MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:52:27,255 INFO L158 Benchmark]: IcfgBuilder took 651.41ms. Allocated memory is still 83.9MB. Free memory was 36.0MB in the beginning and 41.3MB in the end (delta: -5.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2025-03-04 07:52:27,255 INFO L158 Benchmark]: TraceAbstraction took 8137.16ms. Allocated memory is still 83.9MB. Free memory was 40.8MB in the beginning and 15.7MB in the end (delta: 25.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-04 07:52:27,255 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 83.9MB. Free memory was 15.7MB in the beginning and 15.7MB in the end (delta: 7.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:27,256 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.43ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.55ms. Allocated memory is still 83.9MB. Free memory was 58.4MB in the beginning and 40.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.84ms. Allocated memory is still 83.9MB. Free memory was 40.4MB in the beginning and 38.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.93ms. Allocated memory is still 83.9MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 651.41ms. Allocated memory is still 83.9MB. Free memory was 36.0MB in the beginning and 41.3MB in the end (delta: -5.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8137.16ms. Allocated memory is still 83.9MB. Free memory was 40.8MB in the beginning and 15.7MB in the end (delta: 25.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 83.9MB. Free memory was 15.7MB in the beginning and 15.7MB in the end (delta: 7.0kB). 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: 991]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 991. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) [L1007] list->prev = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={3:0}, list={3:0}] [L1013] COND TRUE __VERIFIER_nondet_int() [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={3:0}, list={3:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={3:0}, list={3:0}] [L1040] COND FALSE !(0) VAL [end={3:0}, list={3:0}] [L1041] EXPR end->colour [L1041] COND FALSE !(!(BLACK == end->colour)) [L1041] COND FALSE !(0) VAL [end={3:0}, list={3:0}] [L1043] COND TRUE ((void*)0) != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next [L1051] COND TRUE !(end->next) [L1051] CALL reach_error() [L991] COND FALSE !(0) [L991] __assert_fail ("0", "dll-rb-cnstr_1-2.c", 11, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free 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: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free 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: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free 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. - 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. - 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. - 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. - 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. - 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. - 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. - 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. - 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 2 procedures, 142 locations, 63 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1185 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1185 mSDsluCounter, 2122 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1237 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2141 IncrementalHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 885 mSDtfsCounter, 2141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=0, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 81 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 118 ConstructedInterpolants, 2 QuantifiedInterpolants, 885 SizeOfPredicates, 26 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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-04 07:52:27,275 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