./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.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/mix030_power.opt_pso.opt_rmo.opt.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 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:49:49,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:49:49,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:49:49,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:49:49,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:49:49,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:49:49,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:49:49,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:49:49,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:49:49,095 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:49:49,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:49:49,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:49:49,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:49:49,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:49:49,096 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:49:49,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:49:49,096 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:49:49,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:49:49,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:49:49,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:49:49,096 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:49:49,096 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:49:49,096 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:49:49,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:49:49,097 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:49:49,097 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:49:49,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:49:49,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:49:49,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:49:49,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:49:49,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:49:49,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:49:49,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:49:49,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:49:49,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:49:49,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:49:49,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:49:49,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:49:49,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:49:49,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:49:49,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:49:49,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:49:49,098 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 -> 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 [2025-03-04 09:49:49,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:49:49,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:49:49,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:49:49,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:49:49,318 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:49:49,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2025-03-04 09:49:50,499 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08d599a5/df0e260dc64f4199979ab4510f520af1/FLAG84e416deb [2025-03-04 09:49:50,839 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:49:50,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2025-03-04 09:49:50,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08d599a5/df0e260dc64f4199979ab4510f520af1/FLAG84e416deb [2025-03-04 09:49:51,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08d599a5/df0e260dc64f4199979ab4510f520af1 [2025-03-04 09:49:51,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:49:51,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:49:51,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:49:51,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:49:51,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:49:51,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddeb986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51, skipping insertion in model container [2025-03-04 09:49:51,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:49:51,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:49:51,318 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:49:51,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:49:51,407 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:49:51,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51 WrapperNode [2025-03-04 09:49:51,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:49:51,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:49:51,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:49:51,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:49:51,414 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:49:51" (1/1) ... [2025-03-04 09:49:51,426 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:49:51" (1/1) ... [2025-03-04 09:49:51,445 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2025-03-04 09:49:51,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:49:51,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:49:51,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:49:51,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:49:51,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,474 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:49:51,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:49:51,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:49:51,498 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:49:51,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:49:51,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (1/1) ... [2025-03-04 09:49:51,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:49:51,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:49:51,526 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:49:51,530 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:49:51,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:49:51,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:49:51,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:49:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:49:51,548 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:49:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:49:51,548 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:49:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:49:51,548 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 09:49:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 09:49:51,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:49:51,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:49:51,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:49:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:49:51,549 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:49:51,658 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:49:51,659 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:49:51,965 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:49:51,965 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:49:52,143 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:49:52,143 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:49:52,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:49:52 BoogieIcfgContainer [2025-03-04 09:49:52,144 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:49:52,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:49:52,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:49:52,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:49:52,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:49:51" (1/3) ... [2025-03-04 09:49:52,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580020b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:49:52, skipping insertion in model container [2025-03-04 09:49:52,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:51" (2/3) ... [2025-03-04 09:49:52,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580020b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:49:52, skipping insertion in model container [2025-03-04 09:49:52,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:49:52" (3/3) ... [2025-03-04 09:49:52,152 INFO L128 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2025-03-04 09:49:52,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:49:52,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix030_power.opt_pso.opt_rmo.opt.i that has 5 procedures, 53 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:49:52,191 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:49:52,248 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:49:52,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2025-03-04 09:49:52,310 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-03-04 09:49:52,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:49:52,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2025-03-04 09:49:52,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2025-03-04 09:49:52,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2025-03-04 09:49:52,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:49:52,345 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;@65cc9ca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:49:52,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 09:49:52,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:49:52,351 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-04 09:49:52,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:49:52,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:49:52,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:49:52,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:49:52,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:49:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1758281519, now seen corresponding path program 1 times [2025-03-04 09:49:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:49:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660636648] [2025-03-04 09:49:52,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:49:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:49:52,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:49:52,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:49:52,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:49:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:49:52,766 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:49:52,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:49:52,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660636648] [2025-03-04 09:49:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660636648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:49:52,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:49:52,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:49:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921807038] [2025-03-04 09:49:52,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:49:52,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:49:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:49:52,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:49:52,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:49:52,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-03-04 09:49:52,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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:49:52,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:49:52,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-03-04 09:49:52,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:49:57,208 INFO L124 PetriNetUnfolderBase]: 50459/67067 cut-off events. [2025-03-04 09:49:57,208 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-03-04 09:49:57,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133687 conditions, 67067 events. 50459/67067 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 1939. Compared 407314 event pairs, 6359 based on Foata normal form. 3024/70042 useless extension candidates. Maximal degree in co-relation 133675. Up to 57061 conditions per place. [2025-03-04 09:49:57,507 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 61 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2025-03-04 09:49:57,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 291 flow [2025-03-04 09:49:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:49:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:49:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-04 09:49:57,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2025-03-04 09:49:57,517 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 106 transitions. [2025-03-04 09:49:57,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 291 flow [2025-03-04 09:49:57,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:49:57,525 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2025-03-04 09:49:57,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-03-04 09:49:57,530 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2025-03-04 09:49:57,531 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2025-03-04 09:49:57,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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:49:57,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:49:57,531 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:49:57,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:49:57,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:49:57,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:49:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash -535566644, now seen corresponding path program 1 times [2025-03-04 09:49:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:49:57,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712588514] [2025-03-04 09:49:57,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:49:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:49:57,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:49:57,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:49:57,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:49:57,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:49:57,663 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:49:57,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:49:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712588514] [2025-03-04 09:49:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712588514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:49:57,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:49:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:49:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249564981] [2025-03-04 09:49:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:49:57,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:49:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:49:57,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:49:57,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:49:57,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 09:49:57,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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:49:57,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:49:57,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 09:49:57,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:50:01,140 INFO L124 PetriNetUnfolderBase]: 45383/63887 cut-off events. [2025-03-04 09:50:01,141 INFO L125 PetriNetUnfolderBase]: For 2340/2340 co-relation queries the response was YES. [2025-03-04 09:50:01,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126257 conditions, 63887 events. 45383/63887 cut-off events. For 2340/2340 co-relation queries the response was YES. Maximal size of possible extension queue 1953. Compared 421234 event pairs, 45383 based on Foata normal form. 1512/65140 useless extension candidates. Maximal degree in co-relation 126247. Up to 59508 conditions per place. [2025-03-04 09:50:01,385 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 35 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2025-03-04 09:50:01,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 174 flow [2025-03-04 09:50:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:50:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:50:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 09:50:01,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2025-03-04 09:50:01,388 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 71 transitions. [2025-03-04 09:50:01,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 174 flow [2025-03-04 09:50:01,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:50:01,394 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2025-03-04 09:50:01,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-03-04 09:50:01,395 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2025-03-04 09:50:01,395 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2025-03-04 09:50:01,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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:50:01,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:50:01,396 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:50:01,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:50:01,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:50:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:50:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -535566159, now seen corresponding path program 1 times [2025-03-04 09:50:01,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:50:01,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884732745] [2025-03-04 09:50:01,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:50:01,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:50:01,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:50:01,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:50:01,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:50:01,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:01,983 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:50:01,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:01,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884732745] [2025-03-04 09:50:01,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884732745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:01,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:01,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:50:01,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568867160] [2025-03-04 09:50:01,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:01,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:50:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:01,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:50:01,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:50:01,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 09:50:01,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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:50:01,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:01,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 09:50:01,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:50:09,662 INFO L124 PetriNetUnfolderBase]: 97438/131392 cut-off events. [2025-03-04 09:50:09,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:50:09,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260571 conditions, 131392 events. 97438/131392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3597. Compared 847892 event pairs, 8819 based on Foata normal form. 0/128901 useless extension candidates. Maximal degree in co-relation 260565. Up to 57733 conditions per place. [2025-03-04 09:50:10,144 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 70 selfloop transitions, 14 changer transitions 162/252 dead transitions. [2025-03-04 09:50:10,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 252 transitions, 1010 flow [2025-03-04 09:50:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:50:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 09:50:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 381 transitions. [2025-03-04 09:50:10,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5879629629629629 [2025-03-04 09:50:10,147 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 12 states and 381 transitions. [2025-03-04 09:50:10,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 252 transitions, 1010 flow [2025-03-04 09:50:10,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 252 transitions, 1009 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:50:10,151 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 261 flow [2025-03-04 09:50:10,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=261, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2025-03-04 09:50:10,152 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2025-03-04 09:50:10,152 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 261 flow [2025-03-04 09:50:10,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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:50:10,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:50:10,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:50:10,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:50:10,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:50:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:50:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1151807920, now seen corresponding path program 1 times [2025-03-04 09:50:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:50:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676613033] [2025-03-04 09:50:10,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:50:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:50:10,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:50:10,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:50:10,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:50:10,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:10,634 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:50:10,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676613033] [2025-03-04 09:50:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676613033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:10,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:10,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:50:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003497878] [2025-03-04 09:50:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:10,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:50:10,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:10,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:50:10,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:50:10,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 09:50:10,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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:50:10,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:10,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 09:50:10,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:50:17,827 INFO L124 PetriNetUnfolderBase]: 73425/99645 cut-off events. [2025-03-04 09:50:17,827 INFO L125 PetriNetUnfolderBase]: For 148410/148464 co-relation queries the response was YES. [2025-03-04 09:50:18,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321551 conditions, 99645 events. 73425/99645 cut-off events. For 148410/148464 co-relation queries the response was YES. Maximal size of possible extension queue 2645. Compared 630291 event pairs, 11585 based on Foata normal form. 2472/102098 useless extension candidates. Maximal degree in co-relation 321533. Up to 42809 conditions per place. [2025-03-04 09:50:18,501 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 79 selfloop transitions, 12 changer transitions 130/227 dead transitions. [2025-03-04 09:50:18,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 227 transitions, 1501 flow [2025-03-04 09:50:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:50:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:50:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 307 transitions. [2025-03-04 09:50:18,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5685185185185185 [2025-03-04 09:50:18,503 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 261 flow. Second operand 10 states and 307 transitions. [2025-03-04 09:50:18,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 227 transitions, 1501 flow [2025-03-04 09:50:20,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 227 transitions, 1409 flow, removed 46 selfloop flow, removed 4 redundant places. [2025-03-04 09:50:20,763 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 383 flow [2025-03-04 09:50:20,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=383, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2025-03-04 09:50:20,764 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places. [2025-03-04 09:50:20,764 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 383 flow [2025-03-04 09:50:20,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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:50:20,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:50:20,764 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:50:20,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:50:20,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:50:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:50:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1327474349, now seen corresponding path program 1 times [2025-03-04 09:50:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:50:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892791441] [2025-03-04 09:50:20,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:50:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:50:20,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:50:20,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:50:20,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:50:20,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:21,207 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:50:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892791441] [2025-03-04 09:50:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892791441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:50:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152322685] [2025-03-04 09:50:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:21,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:50:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:21,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:50:21,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:50:21,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 09:50:21,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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:50:21,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:21,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 09:50:21,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand