./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix004.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/mix004.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 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:59:33,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:59:33,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:59:33,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:59:33,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:59:33,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:59:33,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:59:33,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:59:33,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:59:33,500 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:59:33,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:59:33,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:59:33,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:59:33,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:59:33,501 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:59:33,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:59:33,502 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:59:33,502 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:59:33,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:59:33,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:59:33,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:59:33,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:59:33,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:59:33,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:59:33,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:59:33,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:59:33,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:59:33,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:59:33,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:59:33,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:59:33,504 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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d [2025-03-09 00:59:33,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:59:33,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:59:33,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:59:33,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:59:33,754 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:59:33,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix004.opt.i [2025-03-09 00:59:34,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb66d215/79ddf3f3889a42fb91043076b2dcfaca/FLAG1fab1cf6c [2025-03-09 00:59:35,178 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:59:35,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2025-03-09 00:59:35,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb66d215/79ddf3f3889a42fb91043076b2dcfaca/FLAG1fab1cf6c [2025-03-09 00:59:35,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb66d215/79ddf3f3889a42fb91043076b2dcfaca [2025-03-09 00:59:35,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:59:35,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:59:35,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:59:35,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:59:35,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:59:35,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350ce49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35, skipping insertion in model container [2025-03-09 00:59:35,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:59:35,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:59:35,528 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:59:35,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:59:35,626 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:59:35,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35 WrapperNode [2025-03-09 00:59:35,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:59:35,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:59:35,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:59:35,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:59:35,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,679 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2025-03-09 00:59:35,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:59:35,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:59:35,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:59:35,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:59:35,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,717 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-09 00:59:35,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:59:35,739 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:59:35,739 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:59:35,739 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:59:35,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (1/1) ... [2025-03-09 00:59:35,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:59:35,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:59:35,775 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-09 00:59:35,778 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-09 00:59:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:59:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:59:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 00:59:35,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 00:59:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 00:59:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 00:59:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-09 00:59:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-09 00:59:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-09 00:59:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-09 00:59:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:59:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:59:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:59:35,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:59:35,801 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:59:35,926 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:59:35,928 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:59:36,207 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:59:36,207 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:59:36,420 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:59:36,420 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:59:36,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:59:36 BoogieIcfgContainer [2025-03-09 00:59:36,421 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:59:36,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:59:36,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:59:36,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:59:36,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:59:35" (1/3) ... [2025-03-09 00:59:36,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7365f089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:59:36, skipping insertion in model container [2025-03-09 00:59:36,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:59:35" (2/3) ... [2025-03-09 00:59:36,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7365f089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:59:36, skipping insertion in model container [2025-03-09 00:59:36,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:59:36" (3/3) ... [2025-03-09 00:59:36,430 INFO L128 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2025-03-09 00:59:36,440 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:59:36,441 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix004.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-09 00:59:36,441 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:59:36,494 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:59:36,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-03-09 00:59:36,552 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-03-09 00:59:36,555 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:59:36,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-09 00:59:36,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-03-09 00:59:36,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-03-09 00:59:36,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:59:36,581 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;@253c4afb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:59:36,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 00:59:36,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:59:36,594 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-09 00:59:36,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:59:36,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:36,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:36,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 00:59:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash -444890969, now seen corresponding path program 1 times [2025-03-09 00:59:36,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:36,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-03-09 00:59:36,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:36,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:59:36,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:59:36,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:36,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:37,027 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-09 00:59:37,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:37,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-03-09 00:59:37,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394223177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:37,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:37,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:59:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307501661] [2025-03-09 00:59:37,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:59:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:37,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:59:37,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:59:37,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 00:59:37,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-09 00:59:37,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:37,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 00:59:37,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:42,005 INFO L124 PetriNetUnfolderBase]: 59279/78575 cut-off events. [2025-03-09 00:59:42,005 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-03-09 00:59:42,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156679 conditions, 78575 events. 59279/78575 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 2191. Compared 468743 event pairs, 7511 based on Foata normal form. 3528/82028 useless extension candidates. Maximal degree in co-relation 156667. Up to 66889 conditions per place. [2025-03-09 00:59:42,542 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 60 selfloop transitions, 2 changer transitions 2/72 dead transitions. [2025-03-09 00:59:42,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 284 flow [2025-03-09 00:59:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:59:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:59:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-09 00:59:42,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-09 00:59:42,553 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 105 transitions. [2025-03-09 00:59:42,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 284 flow [2025-03-09 00:59:42,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 280 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:59:42,564 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-03-09 00:59:42,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-03-09 00:59:42,569 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-03-09 00:59:42,571 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-03-09 00:59:42,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-09 00:59:42,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:42,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:42,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:59:42,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 00:59:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1326003799, now seen corresponding path program 1 times [2025-03-09 00:59:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428152792] [2025-03-09 00:59:42,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:42,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 00:59:42,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 00:59:42,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:42,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:42,667 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-09 00:59:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:42,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428152792] [2025-03-09 00:59:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428152792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:42,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:42,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:59:42,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909490038] [2025-03-09 00:59:42,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:42,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:59:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:42,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:59:42,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:59:42,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-09 00:59:42,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 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-09 00:59:42,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:42,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-09 00:59:42,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:46,769 INFO L124 PetriNetUnfolderBase]: 53315/74123 cut-off events. [2025-03-09 00:59:46,770 INFO L125 PetriNetUnfolderBase]: For 2268/2268 co-relation queries the response was YES. [2025-03-09 00:59:46,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146765 conditions, 74123 events. 53315/74123 cut-off events. For 2268/2268 co-relation queries the response was YES. Maximal size of possible extension queue 2206. Compared 484893 event pairs, 53315 based on Foata normal form. 1764/75560 useless extension candidates. Maximal degree in co-relation 146755. Up to 69780 conditions per place. [2025-03-09 00:59:47,151 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 36 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-03-09 00:59:47,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 178 flow [2025-03-09 00:59:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:59:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:59:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-09 00:59:47,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-09 00:59:47,153 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 72 transitions. [2025-03-09 00:59:47,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 178 flow [2025-03-09 00:59:47,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:59:47,172 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-03-09 00:59:47,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-03-09 00:59:47,173 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-03-09 00:59:47,173 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-03-09 00:59:47,173 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-09 00:59:47,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:47,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:47,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:59:47,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 00:59:47,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1326003119, now seen corresponding path program 1 times [2025-03-09 00:59:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067547284] [2025-03-09 00:59:47,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:47,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 00:59:47,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 00:59:47,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:47,443 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-09 00:59:47,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067547284] [2025-03-09 00:59:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067547284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:47,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:59:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244908536] [2025-03-09 00:59:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:47,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:59:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:47,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:59:47,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:59:47,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-09 00:59:47,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-09 00:59:47,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:47,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-09 00:59:47,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:52,680 INFO L124 PetriNetUnfolderBase]: 69203/94407 cut-off events. [2025-03-09 00:59:52,681 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:59:52,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185897 conditions, 94407 events. 69203/94407 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 612389 event pairs, 35807 based on Foata normal form. 0/92644 useless extension candidates. Maximal degree in co-relation 185891. Up to 61525 conditions per place. [2025-03-09 00:59:53,125 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 50 selfloop transitions, 5 changer transitions 88/149 dead transitions. [2025-03-09 00:59:53,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 149 transitions, 600 flow [2025-03-09 00:59:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:59:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 00:59:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2025-03-09 00:59:53,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5295454545454545 [2025-03-09 00:59:53,131 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 233 transitions. [2025-03-09 00:59:53,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 149 transitions, 600 flow [2025-03-09 00:59:53,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 149 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:59:53,136 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 152 flow [2025-03-09 00:59:53,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=152, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2025-03-09 00:59:53,137 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-03-09 00:59:53,137 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 152 flow [2025-03-09 00:59:53,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-09 00:59:53,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:53,137 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-09 00:59:53,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:59:53,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 00:59:53,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash -250424152, now seen corresponding path program 1 times [2025-03-09 00:59:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:53,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371787396] [2025-03-09 00:59:53,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:53,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 00:59:53,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 00:59:53,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:53,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:53,324 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-09 00:59:53,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:53,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371787396] [2025-03-09 00:59:53,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371787396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:53,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:53,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:59:53,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354275486] [2025-03-09 00:59:53,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:53,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:59:53,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:53,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:59:53,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:59:53,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-09 00:59:53,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 152 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-09 00:59:53,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:53,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-09 00:59:53,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:58,186 INFO L124 PetriNetUnfolderBase]: 52299/71427 cut-off events. [2025-03-09 00:59:58,186 INFO L125 PetriNetUnfolderBase]: For 52942/52942 co-relation queries the response was YES. [2025-03-09 00:59:58,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179519 conditions, 71427 events. 52299/71427 cut-off events. For 52942/52942 co-relation queries the response was YES. Maximal size of possible extension queue 2032. Compared 452416 event pairs, 10779 based on Foata normal form. 1708/73086 useless extension candidates. Maximal degree in co-relation 179507. Up to 44905 conditions per place. [2025-03-09 00:59:58,570 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 60 selfloop transitions, 3 changer transitions 79/148 dead transitions. [2025-03-09 00:59:58,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 148 transitions, 752 flow [2025-03-09 00:59:58,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:59:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 00:59:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2025-03-09 00:59:58,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2025-03-09 00:59:58,571 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 152 flow. Second operand 7 states and 217 transitions. [2025-03-09 00:59:58,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 148 transitions, 752 flow [2025-03-09 00:59:59,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 148 transitions, 739 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 00:59:59,785 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 162 flow [2025-03-09 00:59:59,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2025-03-09 00:59:59,786 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2025-03-09 00:59:59,787 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 162 flow [2025-03-09 00:59:59,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-09 00:59:59,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:59,787 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-09 00:59:59,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:59:59,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 00:59:59,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1619487780, now seen corresponding path program 1 times [2025-03-09 00:59:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327199220] [2025-03-09 00:59:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:59,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 00:59:59,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 00:59:59,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:59,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:00:00,009 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-09 01:00:00,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:00:00,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327199220] [2025-03-09 01:00:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327199220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:00:00,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:00:00,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:00:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194654950] [2025-03-09 01:00:00,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:00:00,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:00:00,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:00:00,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:00:00,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:00:00,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-09 01:00:00,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 162 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-09 01:00:00,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:00:00,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-09 01:00:00,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:00:04,444 INFO L124 PetriNetUnfolderBase]: 45755/62227 cut-off events. [2025-03-09 01:00:04,444 INFO L125 PetriNetUnfolderBase]: For 60560/60560 co-relation queries the response was YES. [2025-03-09 01:00:04,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160669 conditions, 62227 events. 45755/62227 cut-off events. For 60560/60560 co-relation queries the response was YES. Maximal size of possible extension queue 1592. Compared 373755 event pairs, 10095 based on Foata normal form. 1260/63438 useless extension candidates. Maximal degree in co-relation 160653. Up to 38761 conditions per place. [2025-03-09 01:00:04,833 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 58 selfloop transitions, 3 changer transitions 71/138 dead transitions. [2025-03-09 01:00:04,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 138 transitions, 705 flow [2025-03-09 01:00:04,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:00:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:00:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2025-03-09 01:00:04,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5376623376623376 [2025-03-09 01:00:04,835 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 162 flow. Second operand 7 states and 207 transitions. [2025-03-09 01:00:04,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 138 transitions, 705 flow [2025-03-09 01:00:05,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 138 transitions, 681 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-09 01:00:05,889 INFO L231 Difference]: Finished difference. Result has 69 places, 47 transitions, 167 flow [2025-03-09 01:00:05,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=167, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2025-03-09 01:00:05,892 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-03-09 01:00:05,893 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 47 transitions, 167 flow [2025-03-09 01:00:05,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-09 01:00:05,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:00:05,893 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] [2025-03-09 01:00:05,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:00:05,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:00:05,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:00:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1620202520, now seen corresponding path program 1 times [2025-03-09 01:00:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:00:05,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380400415] [2025-03-09 01:00:05,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:00:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:00:05,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:00:05,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:00:05,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:00:05,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:00:06,078 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-09 01:00:06,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:00:06,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380400415] [2025-03-09 01:00:06,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380400415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:00:06,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:00:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:00:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125719542] [2025-03-09 01:00:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:00:06,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:00:06,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:00:06,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:00:06,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:00:06,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:00:06,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 47 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:00:06,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:00:06,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:00:06,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand