./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi000_tso.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/pthread-wmm/rfi000_tso.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 5128c539cd3051e20c09e1924eb0951d5be697be251e10d3c281464ed4c436cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:53:01,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:53:01,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:53:01,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:53:01,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:53:01,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:53:01,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:53:01,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:53:01,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:53:01,592 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:53:01,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:53:01,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:53:01,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:53:01,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:53:01,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:53:01,593 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:53:01,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:53:01,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:53:01,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:53:01,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:53:01,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:53:01,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:53:01,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:53:01,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:53:01,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:53:01,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:53:01,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:53:01,594 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 -> 5128c539cd3051e20c09e1924eb0951d5be697be251e10d3c281464ed4c436cd [2025-03-04 09:53:01,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:53:01,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:53:01,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:53:01,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:53:01,811 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:53:01,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi000_tso.i [2025-03-04 09:53:02,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3f9164e/43913016e2a2444ebc31e13a054e008d/FLAG0cc6ba7ec [2025-03-04 09:53:03,231 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:53:03,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi000_tso.i [2025-03-04 09:53:03,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3f9164e/43913016e2a2444ebc31e13a054e008d/FLAG0cc6ba7ec [2025-03-04 09:53:03,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3f9164e/43913016e2a2444ebc31e13a054e008d [2025-03-04 09:53:03,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:53:03,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:53:03,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:53:03,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:53:03,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:53:03,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:53:03" (1/1) ... [2025-03-04 09:53:03,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf48456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:03, skipping insertion in model container [2025-03-04 09:53:03,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:53:03" (1/1) ... [2025-03-04 09:53:03,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:53:03,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:53:03,907 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:53:03,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:53:04,001 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:53:04,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04 WrapperNode [2025-03-04 09:53:04,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:53:04,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:53:04,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:53:04,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:53:04,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,057 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2025-03-04 09:53:04,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:53:04,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:53:04,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:53:04,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:53:04,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,095 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:53:04,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,105 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:53:04,117 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:53:04,117 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:53:04,117 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:53:04,117 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (1/1) ... [2025-03-04 09:53:04,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:53:04,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:04,155 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 09:53:04,162 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 09:53:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:53:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:53:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:53:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:53:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:53:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:53:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:53:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:53:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:53:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:53:04,180 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:53:04,270 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:53:04,272 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:53:04,551 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:53:04,552 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:53:04,723 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:53:04,723 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:53:04,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:53:04 BoogieIcfgContainer [2025-03-04 09:53:04,723 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:53:04,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:53:04,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:53:04,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:53:04,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:53:03" (1/3) ... [2025-03-04 09:53:04,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533e328b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:53:04, skipping insertion in model container [2025-03-04 09:53:04,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:04" (2/3) ... [2025-03-04 09:53:04,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533e328b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:53:04, skipping insertion in model container [2025-03-04 09:53:04,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:53:04" (3/3) ... [2025-03-04 09:53:04,731 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi000_tso.i [2025-03-04 09:53:04,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:53:04,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi000_tso.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:53:04,744 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:53:04,797 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:53:04,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2025-03-04 09:53:04,845 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2025-03-04 09:53:04,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:53:04,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-04 09:53:04,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2025-03-04 09:53:04,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2025-03-04 09:53:04,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:53:04,870 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;@74ccdd93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:53:04,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 09:53:04,876 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:53:04,876 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 09:53:04,876 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:53:04,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:04,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:04,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:04,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash -770572776, now seen corresponding path program 1 times [2025-03-04 09:53:04,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:04,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266264455] [2025-03-04 09:53:04,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:04,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:53:04,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:53:04,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:04,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:05,248 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 09:53:05,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266264455] [2025-03-04 09:53:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266264455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:05,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:53:05,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562214959] [2025-03-04 09:53:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:05,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:53:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:05,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:53:05,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:53:05,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-04 09:53:05,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:05,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:05,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-04 09:53:05,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:05,657 INFO L124 PetriNetUnfolderBase]: 783/1327 cut-off events. [2025-03-04 09:53:05,657 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 09:53:05,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 1327 events. 783/1327 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6600 event pairs, 159 based on Foata normal form. 96/1420 useless extension candidates. Maximal degree in co-relation 2611. Up to 985 conditions per place. [2025-03-04 09:53:05,669 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2025-03-04 09:53:05,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 174 flow [2025-03-04 09:53:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:53:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:53:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-03-04 09:53:05,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-03-04 09:53:05,680 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 68 transitions. [2025-03-04 09:53:05,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 174 flow [2025-03-04 09:53:05,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:53:05,685 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2025-03-04 09:53:05,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-03-04 09:53:05,691 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-03-04 09:53:05,692 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2025-03-04 09:53:05,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:05,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:05,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:05,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:53:05,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:05,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash 367777938, now seen corresponding path program 1 times [2025-03-04 09:53:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:05,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267656899] [2025-03-04 09:53:05,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:05,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:05,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:53:05,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:53:05,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:05,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:05,773 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 09:53:05,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267656899] [2025-03-04 09:53:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267656899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:05,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:05,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:53:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161361088] [2025-03-04 09:53:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:05,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:53:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:05,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:53:05,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:53:05,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:05,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:05,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:05,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:05,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:05,947 INFO L124 PetriNetUnfolderBase]: 701/1251 cut-off events. [2025-03-04 09:53:05,947 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-04 09:53:05,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 1251 events. 701/1251 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6300 event pairs, 701 based on Foata normal form. 48/1290 useless extension candidates. Maximal degree in co-relation 2459. Up to 1146 conditions per place. [2025-03-04 09:53:05,955 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 22 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2025-03-04 09:53:05,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 114 flow [2025-03-04 09:53:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:53:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:53:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-04 09:53:05,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4144144144144144 [2025-03-04 09:53:05,956 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 46 transitions. [2025-03-04 09:53:05,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 114 flow [2025-03-04 09:53:05,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:53:05,957 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2025-03-04 09:53:05,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-04 09:53:05,958 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-03-04 09:53:05,958 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2025-03-04 09:53:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:05,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:05,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:05,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:53:05,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:05,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:05,958 INFO L85 PathProgramCache]: Analyzing trace with hash 367778552, now seen corresponding path program 1 times [2025-03-04 09:53:05,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:05,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013437338] [2025-03-04 09:53:05,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:05,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:53:05,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:53:05,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:05,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:06,260 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 09:53:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:06,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013437338] [2025-03-04 09:53:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013437338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:06,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:06,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:53:06,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033595571] [2025-03-04 09:53:06,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:06,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:53:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:06,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:53:06,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:53:06,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:06,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:06,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:06,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:06,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:06,631 INFO L124 PetriNetUnfolderBase]: 885/1561 cut-off events. [2025-03-04 09:53:06,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:53:06,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 1561 events. 885/1561 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8153 event pairs, 327 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 3039. Up to 978 conditions per place. [2025-03-04 09:53:06,637 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 29 selfloop transitions, 3 changer transitions 48/84 dead transitions. [2025-03-04 09:53:06,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 84 transitions, 336 flow [2025-03-04 09:53:06,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:53:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:53:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2025-03-04 09:53:06,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2025-03-04 09:53:06,639 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 8 states and 138 transitions. [2025-03-04 09:53:06,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 84 transitions, 336 flow [2025-03-04 09:53:06,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 84 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:53:06,641 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 94 flow [2025-03-04 09:53:06,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=94, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2025-03-04 09:53:06,642 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-04 09:53:06,642 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 94 flow [2025-03-04 09:53:06,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:06,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:06,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:06,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:53:06,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1643137431, now seen corresponding path program 1 times [2025-03-04 09:53:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079970961] [2025-03-04 09:53:06,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:06,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:06,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:53:06,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:53:06,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:06,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:07,228 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 09:53:07,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:07,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079970961] [2025-03-04 09:53:07,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079970961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:07,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:07,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:53:07,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650771623] [2025-03-04 09:53:07,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:07,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:53:07,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:07,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:53:07,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:53:07,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:07,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 09:53:07,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:07,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:07,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:07,828 INFO L124 PetriNetUnfolderBase]: 726/1274 cut-off events. [2025-03-04 09:53:07,828 INFO L125 PetriNetUnfolderBase]: For 812/815 co-relation queries the response was YES. [2025-03-04 09:53:07,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1274 events. 726/1274 cut-off events. For 812/815 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6088 event pairs, 190 based on Foata normal form. 51/1323 useless extension candidates. Maximal degree in co-relation 3100. Up to 654 conditions per place. [2025-03-04 09:53:07,834 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 38 selfloop transitions, 7 changer transitions 49/98 dead transitions. [2025-03-04 09:53:07,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 98 transitions, 486 flow [2025-03-04 09:53:07,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:53:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:53:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2025-03-04 09:53:07,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2025-03-04 09:53:07,835 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 94 flow. Second operand 10 states and 165 transitions. [2025-03-04 09:53:07,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 98 transitions, 486 flow [2025-03-04 09:53:07,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 98 transitions, 463 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-04 09:53:07,841 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 171 flow [2025-03-04 09:53:07,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=171, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2025-03-04 09:53:07,842 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-03-04 09:53:07,842 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 171 flow [2025-03-04 09:53:07,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 09:53:07,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:07,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:53:07,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1791816678, now seen corresponding path program 1 times [2025-03-04 09:53:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:07,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212065257] [2025-03-04 09:53:07,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:07,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:53:07,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:53:07,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:07,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:08,110 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 09:53:08,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212065257] [2025-03-04 09:53:08,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212065257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:08,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:08,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:53:08,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895732020] [2025-03-04 09:53:08,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:08,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:53:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:08,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:53:08,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:53:08,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:08,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 09:53:08,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:08,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:08,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:08,385 INFO L124 PetriNetUnfolderBase]: 631/1122 cut-off events. [2025-03-04 09:53:08,385 INFO L125 PetriNetUnfolderBase]: For 2315/2318 co-relation queries the response was YES. [2025-03-04 09:53:08,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1122 events. 631/1122 cut-off events. For 2315/2318 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5191 event pairs, 245 based on Foata normal form. 35/1155 useless extension candidates. Maximal degree in co-relation 3747. Up to 588 conditions per place. [2025-03-04 09:53:08,392 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 38 selfloop transitions, 3 changer transitions 39/84 dead transitions. [2025-03-04 09:53:08,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 599 flow [2025-03-04 09:53:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:53:08,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:53:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2025-03-04 09:53:08,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44015444015444016 [2025-03-04 09:53:08,394 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 171 flow. Second operand 7 states and 114 transitions. [2025-03-04 09:53:08,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 599 flow [2025-03-04 09:53:08,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 575 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-04 09:53:08,410 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 174 flow [2025-03-04 09:53:08,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2025-03-04 09:53:08,411 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-03-04 09:53:08,411 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 174 flow [2025-03-04 09:53:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 09:53:08,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:08,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:08,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:53:08,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:08,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1382385121, now seen corresponding path program 1 times [2025-03-04 09:53:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564507627] [2025-03-04 09:53:08,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:08,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:53:08,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:53:08,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:08,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:09,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564507627] [2025-03-04 09:53:09,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564507627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:09,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:09,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:53:09,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100328810] [2025-03-04 09:53:09,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:09,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:53:09,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:09,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:53:09,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:53:09,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:09,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 174 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 09:53:09,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:09,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:09,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:09,667 INFO L124 PetriNetUnfolderBase]: 612/1092 cut-off events. [2025-03-04 09:53:09,667 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2025-03-04 09:53:09,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 1092 events. 612/1092 cut-off events. For 2163/2163 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4983 event pairs, 260 based on Foata normal form. 27/1118 useless extension candidates. Maximal degree in co-relation 3646. Up to 851 conditions per place. [2025-03-04 09:53:09,675 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 47 selfloop transitions, 7 changer transitions 29/87 dead transitions. [2025-03-04 09:53:09,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 87 transitions, 570 flow [2025-03-04 09:53:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:53:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:53:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2025-03-04 09:53:09,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4114114114114114 [2025-03-04 09:53:09,677 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 174 flow. Second operand 9 states and 137 transitions. [2025-03-04 09:53:09,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 87 transitions, 570 flow [2025-03-04 09:53:09,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 539 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-04 09:53:09,683 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 213 flow [2025-03-04 09:53:09,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=213, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2025-03-04 09:53:09,683 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2025-03-04 09:53:09,683 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 213 flow [2025-03-04 09:53:09,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 09:53:09,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:09,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:53:09,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:09,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 516146661, now seen corresponding path program 2 times [2025-03-04 09:53:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220178055] [2025-03-04 09:53:09,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:53:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:09,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:53:09,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:53:09,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:53:09,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:10,390 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 09:53:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220178055] [2025-03-04 09:53:10,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220178055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:10,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:10,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:53:10,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728800380] [2025-03-04 09:53:10,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:10,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:53:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:10,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:53:10,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:53:10,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:10,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 213 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 09:53:10,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:10,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:10,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:10,756 INFO L124 PetriNetUnfolderBase]: 591/1051 cut-off events. [2025-03-04 09:53:10,756 INFO L125 PetriNetUnfolderBase]: For 2147/2147 co-relation queries the response was YES. [2025-03-04 09:53:10,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1051 events. 591/1051 cut-off events. For 2147/2147 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4671 event pairs, 257 based on Foata normal form. 27/1077 useless extension candidates. Maximal degree in co-relation 3664. Up to 809 conditions per place. [2025-03-04 09:53:10,762 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 45 selfloop transitions, 8 changer transitions 29/86 dead transitions. [2025-03-04 09:53:10,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 598 flow [2025-03-04 09:53:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:53:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:53:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2025-03-04 09:53:10,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4189189189189189 [2025-03-04 09:53:10,763 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 213 flow. Second operand 8 states and 124 transitions. [2025-03-04 09:53:10,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 598 flow [2025-03-04 09:53:10,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 580 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-04 09:53:10,771 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 249 flow [2025-03-04 09:53:10,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=249, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-03-04 09:53:10,771 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2025-03-04 09:53:10,771 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 249 flow [2025-03-04 09:53:10,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 09:53:10,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:10,772 INFO L206 CegarLoopForPetriNet]: 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 09:53:10,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:53:10,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:10,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1928499904, now seen corresponding path program 1 times [2025-03-04 09:53:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313405799] [2025-03-04 09:53:10,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:10,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:10,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:53:10,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:53:10,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:10,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313405799] [2025-03-04 09:53:10,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313405799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:10,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:10,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:53:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554929450] [2025-03-04 09:53:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:10,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:53:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:10,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:53:10,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:53:10,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-04 09:53:10,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:10,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:10,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-04 09:53:10,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:11,083 INFO L124 PetriNetUnfolderBase]: 380/713 cut-off events. [2025-03-04 09:53:11,083 INFO L125 PetriNetUnfolderBase]: For 1285/1288 co-relation queries the response was YES. [2025-03-04 09:53:11,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 713 events. 380/713 cut-off events. For 1285/1288 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3057 event pairs, 86 based on Foata normal form. 53/764 useless extension candidates. Maximal degree in co-relation 2443. Up to 302 conditions per place. [2025-03-04 09:53:11,088 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 57 selfloop transitions, 4 changer transitions 1/66 dead transitions. [2025-03-04 09:53:11,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 502 flow [2025-03-04 09:53:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:53:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:53:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-04 09:53:11,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-03-04 09:53:11,089 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 249 flow. Second operand 4 states and 83 transitions. [2025-03-04 09:53:11,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 502 flow [2025-03-04 09:53:11,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 459 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-03-04 09:53:11,093 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 217 flow [2025-03-04 09:53:11,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-03-04 09:53:11,093 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-03-04 09:53:11,094 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 217 flow [2025-03-04 09:53:11,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:11,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:11,094 INFO L206 CegarLoopForPetriNet]: 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 09:53:11,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:53:11,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 308823575, now seen corresponding path program 1 times [2025-03-04 09:53:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623140812] [2025-03-04 09:53:11,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:11,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:53:11,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:53:11,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:11,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:12,198 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 09:53:12,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:12,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623140812] [2025-03-04 09:53:12,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623140812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:12,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:12,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:53:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771874528] [2025-03-04 09:53:12,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:12,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:53:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:12,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:53:12,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:53:12,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:12,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 217 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 09:53:12,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:12,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:12,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:12,653 INFO L124 PetriNetUnfolderBase]: 509/941 cut-off events. [2025-03-04 09:53:12,653 INFO L125 PetriNetUnfolderBase]: For 1556/1559 co-relation queries the response was YES. [2025-03-04 09:53:12,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3354 conditions, 941 events. 509/941 cut-off events. For 1556/1559 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4222 event pairs, 145 based on Foata normal form. 14/953 useless extension candidates. Maximal degree in co-relation 3331. Up to 425 conditions per place. [2025-03-04 09:53:12,658 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 63 selfloop transitions, 19 changer transitions 25/111 dead transitions. [2025-03-04 09:53:12,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 111 transitions, 838 flow [2025-03-04 09:53:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:53:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:53:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2025-03-04 09:53:12,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2025-03-04 09:53:12,660 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 217 flow. Second operand 9 states and 151 transitions. [2025-03-04 09:53:12,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 111 transitions, 838 flow [2025-03-04 09:53:12,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 111 transitions, 805 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 09:53:12,663 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 403 flow [2025-03-04 09:53:12,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2025-03-04 09:53:12,664 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2025-03-04 09:53:12,664 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 403 flow [2025-03-04 09:53:12,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 09:53:12,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:12,664 INFO L206 CegarLoopForPetriNet]: 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 09:53:12,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:53:12,665 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:12,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1397002891, now seen corresponding path program 2 times [2025-03-04 09:53:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:12,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396424838] [2025-03-04 09:53:12,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:53:12,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:12,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:53:12,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:53:12,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:53:12,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:14,137 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 09:53:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396424838] [2025-03-04 09:53:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396424838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:14,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:53:14,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752029837] [2025-03-04 09:53:14,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:14,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:53:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:14,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:53:14,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:53:14,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:14,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 403 flow. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 09:53:14,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:14,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:14,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:14,967 INFO L124 PetriNetUnfolderBase]: 808/1537 cut-off events. [2025-03-04 09:53:14,968 INFO L125 PetriNetUnfolderBase]: For 3729/3729 co-relation queries the response was YES. [2025-03-04 09:53:14,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5875 conditions, 1537 events. 808/1537 cut-off events. For 3729/3729 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8191 event pairs, 253 based on Foata normal form. 14/1550 useless extension candidates. Maximal degree in co-relation 5846. Up to 544 conditions per place. [2025-03-04 09:53:14,979 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 91 selfloop transitions, 23 changer transitions 29/147 dead transitions. [2025-03-04 09:53:14,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 147 transitions, 1300 flow [2025-03-04 09:53:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:53:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:53:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2025-03-04 09:53:14,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2025-03-04 09:53:14,981 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 403 flow. Second operand 10 states and 177 transitions. [2025-03-04 09:53:14,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 147 transitions, 1300 flow [2025-03-04 09:53:14,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 147 transitions, 1232 flow, removed 34 selfloop flow, removed 2 redundant places. [2025-03-04 09:53:14,991 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 568 flow [2025-03-04 09:53:14,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=568, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-03-04 09:53:14,993 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2025-03-04 09:53:14,993 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 568 flow [2025-03-04 09:53:14,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 09:53:14,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:14,994 INFO L206 CegarLoopForPetriNet]: 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 09:53:14,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:53:14,994 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:14,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash 331093015, now seen corresponding path program 3 times [2025-03-04 09:53:14,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:14,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713181384] [2025-03-04 09:53:14,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:53:14,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:15,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:53:15,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:53:15,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:53:15,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:15,143 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 09:53:15,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:15,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713181384] [2025-03-04 09:53:15,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713181384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:15,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:15,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:53:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281863771] [2025-03-04 09:53:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:53:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:15,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:53:15,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:53:15,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-04 09:53:15,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 568 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 09:53:15,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:15,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-04 09:53:15,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:15,288 INFO L124 PetriNetUnfolderBase]: 465/917 cut-off events. [2025-03-04 09:53:15,289 INFO L125 PetriNetUnfolderBase]: For 2785/2788 co-relation queries the response was YES. [2025-03-04 09:53:15,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 917 events. 465/917 cut-off events. For 2785/2788 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4523 event pairs, 97 based on Foata normal form. 80/995 useless extension candidates. Maximal degree in co-relation 3455. Up to 428 conditions per place. [2025-03-04 09:53:15,293 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 60 selfloop transitions, 6 changer transitions 14/84 dead transitions. [2025-03-04 09:53:15,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 850 flow [2025-03-04 09:53:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:53:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:53:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-03-04 09:53:15,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2025-03-04 09:53:15,295 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 568 flow. Second operand 5 states and 84 transitions. [2025-03-04 09:53:15,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 84 transitions, 850 flow [2025-03-04 09:53:15,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 84 transitions, 736 flow, removed 43 selfloop flow, removed 9 redundant places. [2025-03-04 09:53:15,302 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 390 flow [2025-03-04 09:53:15,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=390, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2025-03-04 09:53:15,303 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2025-03-04 09:53:15,303 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 390 flow [2025-03-04 09:53:15,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 09:53:15,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:15,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 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 09:53:15,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:53:15,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:15,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1278280432, now seen corresponding path program 1 times [2025-03-04 09:53:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576857400] [2025-03-04 09:53:15,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:15,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:53:15,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:53:15,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:15,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:16,609 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 09:53:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576857400] [2025-03-04 09:53:16,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576857400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:16,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:16,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:53:16,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785241423] [2025-03-04 09:53:16,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:16,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:53:16,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:16,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:53:16,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:53:16,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:16,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 390 flow. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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 09:53:16,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:16,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:16,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:17,037 INFO L124 PetriNetUnfolderBase]: 273/551 cut-off events. [2025-03-04 09:53:17,038 INFO L125 PetriNetUnfolderBase]: For 1146/1149 co-relation queries the response was YES. [2025-03-04 09:53:17,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2014 conditions, 551 events. 273/551 cut-off events. For 1146/1149 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2233 event pairs, 83 based on Foata normal form. 8/557 useless extension candidates. Maximal degree in co-relation 1983. Up to 246 conditions per place. [2025-03-04 09:53:17,040 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 29 selfloop transitions, 7 changer transitions 40/80 dead transitions. [2025-03-04 09:53:17,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 668 flow [2025-03-04 09:53:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:53:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:53:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2025-03-04 09:53:17,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3614864864864865 [2025-03-04 09:53:17,041 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 390 flow. Second operand 8 states and 107 transitions. [2025-03-04 09:53:17,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 668 flow [2025-03-04 09:53:17,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 80 transitions, 571 flow, removed 26 selfloop flow, removed 12 redundant places. [2025-03-04 09:53:17,045 INFO L231 Difference]: Finished difference. Result has 71 places, 35 transitions, 212 flow [2025-03-04 09:53:17,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=212, PETRI_PLACES=71, PETRI_TRANSITIONS=35} [2025-03-04 09:53:17,046 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2025-03-04 09:53:17,046 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 35 transitions, 212 flow [2025-03-04 09:53:17,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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 09:53:17,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:17,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 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 09:53:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:53:17,047 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash 836994960, now seen corresponding path program 2 times [2025-03-04 09:53:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963654518] [2025-03-04 09:53:17,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:53:17,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:17,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:53:17,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:53:17,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:53:17,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:17,200 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 09:53:17,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963654518] [2025-03-04 09:53:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963654518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:17,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:17,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:53:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657778013] [2025-03-04 09:53:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:17,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:53:17,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:17,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:53:17,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:53:17,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 09:53:17,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 35 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:17,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:17,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 09:53:17,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:17,303 INFO L124 PetriNetUnfolderBase]: 98/197 cut-off events. [2025-03-04 09:53:17,304 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2025-03-04 09:53:17,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 197 events. 98/197 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 539 event pairs, 24 based on Foata normal form. 4/200 useless extension candidates. Maximal degree in co-relation 664. Up to 128 conditions per place. [2025-03-04 09:53:17,305 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 0 selfloop transitions, 0 changer transitions 39/39 dead transitions. [2025-03-04 09:53:17,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 39 transitions, 294 flow [2025-03-04 09:53:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:53:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:53:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-03-04 09:53:17,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3567567567567568 [2025-03-04 09:53:17,306 INFO L175 Difference]: Start difference. First operand has 71 places, 35 transitions, 212 flow. Second operand 5 states and 66 transitions. [2025-03-04 09:53:17,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 39 transitions, 294 flow [2025-03-04 09:53:17,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 209 flow, removed 7 selfloop flow, removed 25 redundant places. [2025-03-04 09:53:17,307 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2025-03-04 09:53:17,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2025-03-04 09:53:17,309 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2025-03-04 09:53:17,309 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2025-03-04 09:53:17,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:17,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-04 09:53:17,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-04 09:53:17,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-04 09:53:17,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-04 09:53:17,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-04 09:53:17,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-04 09:53:17,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:53:17,313 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:17,318 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:53:17,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:53:17,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:53:17 BasicIcfg [2025-03-04 09:53:17,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:53:17,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:53:17,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:53:17,324 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:53:17,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:53:04" (3/4) ... [2025-03-04 09:53:17,325 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 09:53:17,327 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-04 09:53:17,327 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-04 09:53:17,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-03-04 09:53:17,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 09:53:17,332 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 09:53:17,332 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 09:53:17,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 09:53:17,389 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 09:53:17,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:53:17,390 INFO L158 Benchmark]: Toolchain (without parser) took 13866.10ms. Allocated memory was 201.3MB in the beginning and 570.4MB in the end (delta: 369.1MB). Free memory was 156.9MB in the beginning and 366.0MB in the end (delta: -209.0MB). Peak memory consumption was 161.2MB. Max. memory is 16.1GB. [2025-03-04 09:53:17,390 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:17,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.05ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 131.9MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:53:17,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.53ms. Allocated memory is still 201.3MB. Free memory was 131.9MB in the beginning and 128.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:17,391 INFO L158 Benchmark]: Boogie Preprocessor took 56.39ms. Allocated memory is still 201.3MB. Free memory was 128.9MB in the beginning and 124.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:53:17,392 INFO L158 Benchmark]: IcfgBuilder took 606.89ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 57.2MB in the end (delta: 67.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 09:53:17,392 INFO L158 Benchmark]: TraceAbstraction took 12597.82ms. Allocated memory was 201.3MB in the beginning and 570.4MB in the end (delta: 369.1MB). Free memory was 56.4MB in the beginning and 370.2MB in the end (delta: -313.8MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2025-03-04 09:53:17,393 INFO L158 Benchmark]: Witness Printer took 65.47ms. Allocated memory is still 570.4MB. Free memory was 370.2MB in the beginning and 366.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:53:17,394 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.17ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.05ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 131.9MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.53ms. Allocated memory is still 201.3MB. Free memory was 131.9MB in the beginning and 128.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.39ms. Allocated memory is still 201.3MB. Free memory was 128.9MB in the beginning and 124.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 606.89ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 57.2MB in the end (delta: 67.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12597.82ms. Allocated memory was 201.3MB in the beginning and 570.4MB in the end (delta: 369.1MB). Free memory was 56.4MB in the beginning and 370.2MB in the end (delta: -313.8MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * Witness Printer took 65.47ms. Allocated memory is still 570.4MB. Free memory was 370.2MB in the beginning and 366.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 824]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 527 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2421 IncrementalHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 1 mSDtfsCounter, 2421 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=568occurred in iteration=10, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 1957 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 09:53:17,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE