./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix029_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/mix029_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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:49:47,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:49:47,464 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:47,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:49:47,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:49:47,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:49:47,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:49:47,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:49:47,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:49:47,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:49:47,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:49:47,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:49:47,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:49:47,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:49:47,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:49:47,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:49:47,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:49:47,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:49:47,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:49:47,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:49:47,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:49:47,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:49:47,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:49:47,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:49:47,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:49:47,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:49:47,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:49:47,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:49:47,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:49:47,497 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2025-03-04 09:49:47,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:49:47,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:49:47,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:49:47,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:49:47,733 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:49:47,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2025-03-04 09:49:48,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4212d2a58/93f5f6e68c734a6380f39ae18ee3284f/FLAG1b27e7bb5 [2025-03-04 09:49:49,140 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:49:49,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2025-03-04 09:49:49,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4212d2a58/93f5f6e68c734a6380f39ae18ee3284f/FLAG1b27e7bb5 [2025-03-04 09:49:49,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4212d2a58/93f5f6e68c734a6380f39ae18ee3284f [2025-03-04 09:49:49,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:49:49,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:49:49,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:49:49,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:49:49,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:49:49,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:49:49" (1/1) ... [2025-03-04 09:49:49,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378fba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:49, skipping insertion in model container [2025-03-04 09:49:49,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:49:49" (1/1) ... [2025-03-04 09:49:49,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:49:49,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:49:49,771 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:49:49,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:49:49,854 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:49:49,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:49 WrapperNode [2025-03-04 09:49:49,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:49:49,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:49:49,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:49:49,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:49:49,860 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:49" (1/1) ... [2025-03-04 09:49:49,869 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:49" (1/1) ... [2025-03-04 09:49:49,899 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2025-03-04 09:49:49,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:49:49,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:49:49,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:49:49,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:49:49,909 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:49" (1/1) ... [2025-03-04 09:49:49,909 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:49" (1/1) ... [2025-03-04 09:49:49,915 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:49" (1/1) ... [2025-03-04 09:49:49,926 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:49,931 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:49" (1/1) ... [2025-03-04 09:49:49,931 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:49" (1/1) ... [2025-03-04 09:49:49,940 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:49" (1/1) ... [2025-03-04 09:49:49,942 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:49" (1/1) ... [2025-03-04 09:49:49,947 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:49" (1/1) ... [2025-03-04 09:49:49,948 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:49" (1/1) ... [2025-03-04 09:49:49,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:49:49,955 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:49:49,955 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:49:49,955 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:49:49,956 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:49" (1/1) ... [2025-03-04 09:49:49,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:49:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:49:49,989 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:49,991 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:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:49:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:49:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:49:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:49:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:49:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:49:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:49:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:49:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 09:49:50,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 09:49:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:49:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:49:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:49:50,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:49:50,013 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:50,105 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:49:50,107 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:49:50,356 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:49:50,356 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:49:50,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:49:50,534 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:49:50,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:49:50 BoogieIcfgContainer [2025-03-04 09:49:50,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:49:50,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:49:50,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:49:50,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:49:50,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:49:49" (1/3) ... [2025-03-04 09:49:50,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adf6fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:49:50, skipping insertion in model container [2025-03-04 09:49:50,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:49:49" (2/3) ... [2025-03-04 09:49:50,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adf6fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:49:50, skipping insertion in model container [2025-03-04 09:49:50,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:49:50" (3/3) ... [2025-03-04 09:49:50,542 INFO L128 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2025-03-04 09:49:50,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:49:50,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix029_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:50,553 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:49:50,596 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:49:50,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2025-03-04 09:49:50,646 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-03-04 09:49:50,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:49:50,652 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 6. Compared 112 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:50,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2025-03-04 09:49:50,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2025-03-04 09:49:50,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:49:50,680 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;@3060c1b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:49:50,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 09:49:50,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:49:50,685 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-04 09:49:50,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:49:50,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:49:50,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:49:50,686 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:50,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:49:50,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1708399575, now seen corresponding path program 1 times [2025-03-04 09:49:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:49:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296346890] [2025-03-04 09:49:50,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:49:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:49:50,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:49:50,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:49:50,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:49:50,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:49:51,067 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:51,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:49:51,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296346890] [2025-03-04 09:49:51,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296346890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:49:51,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:49:51,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:49:51,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961561030] [2025-03-04 09:49:51,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:49:51,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:49:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:49:51,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:49:51,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:49:51,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-03-04 09:49:51,097 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:51,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:49:51,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-03-04 09:49:51,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:49:55,238 INFO L124 PetriNetUnfolderBase]: 50459/66917 cut-off events. [2025-03-04 09:49:55,239 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-03-04 09:49:55,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133537 conditions, 66917 events. 50459/66917 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 1943. Compared 403098 event pairs, 6359 based on Foata normal form. 2988/69834 useless extension candidates. Maximal degree in co-relation 133525. Up to 57061 conditions per place. [2025-03-04 09:49:55,629 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 61 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2025-03-04 09:49:55,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 291 flow [2025-03-04 09:49:55,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:49:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:49:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-04 09:49:55,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2025-03-04 09:49:55,641 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:55,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 291 flow [2025-03-04 09:49:55,649 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:55,651 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2025-03-04 09:49:55,653 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:55,656 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2025-03-04 09:49:55,656 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2025-03-04 09:49:55,656 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:55,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:49:55,657 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:55,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:49:55,657 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:55,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:49:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash -88814277, now seen corresponding path program 1 times [2025-03-04 09:49:55,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:49:55,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376579418] [2025-03-04 09:49:55,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:49:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:49:55,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:49:55,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:49:55,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:49:55,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:49:55,755 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:55,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:49:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376579418] [2025-03-04 09:49:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376579418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:49:55,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:49:55,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:49:55,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136394845] [2025-03-04 09:49:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:49:55,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:49:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:49:55,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:49:55,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:49:55,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 09:49:55,758 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:55,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:49:55,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 09:49:55,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:49:58,947 INFO L124 PetriNetUnfolderBase]: 45383/63229 cut-off events. [2025-03-04 09:49:58,947 INFO L125 PetriNetUnfolderBase]: For 2340/2340 co-relation queries the response was YES. [2025-03-04 09:49:59,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125599 conditions, 63229 events. 45383/63229 cut-off events. For 2340/2340 co-relation queries the response was YES. Maximal size of possible extension queue 1954. Compared 409485 event pairs, 45383 based on Foata normal form. 1512/64441 useless extension candidates. Maximal degree in co-relation 125589. Up to 59508 conditions per place. [2025-03-04 09:49:59,262 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 35 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2025-03-04 09:49:59,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 174 flow [2025-03-04 09:49:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:49:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:49:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 09:49:59,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2025-03-04 09:49:59,265 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:49:59,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 174 flow [2025-03-04 09:49:59,269 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:49:59,270 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2025-03-04 09:49:59,270 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:49:59,271 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2025-03-04 09:49:59,271 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2025-03-04 09:49:59,272 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:49:59,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:49:59,272 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:59,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:49:59,272 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:49:59,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:49:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash -88813513, now seen corresponding path program 1 times [2025-03-04 09:49:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:49:59,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349528562] [2025-03-04 09:49:59,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:49:59,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:49:59,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:49:59,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:49:59,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:49:59,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:00,318 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:00,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:00,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349528562] [2025-03-04 09:50:00,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349528562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:00,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:00,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:50:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823036659] [2025-03-04 09:50:00,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:00,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:50:00,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:00,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:50:00,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:50:00,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 09:50:00,323 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:00,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:00,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 09:50:00,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:50:05,440 INFO L124 PetriNetUnfolderBase]: 60611/81913 cut-off events. [2025-03-04 09:50:05,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:50:05,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162139 conditions, 81913 events. 60611/81913 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2397. Compared 508188 event pairs, 9851 based on Foata normal form. 0/80569 useless extension candidates. Maximal degree in co-relation 162133. Up to 38389 conditions per place. [2025-03-04 09:50:05,762 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 67 selfloop transitions, 9 changer transitions 146/228 dead transitions. [2025-03-04 09:50:05,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 228 transitions, 910 flow [2025-03-04 09:50:05,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:50:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 09:50:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 357 transitions. [2025-03-04 09:50:05,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5509259259259259 [2025-03-04 09:50:05,768 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 12 states and 357 transitions. [2025-03-04 09:50:05,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 228 transitions, 910 flow [2025-03-04 09:50:05,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 228 transitions, 909 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:50:05,774 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 209 flow [2025-03-04 09:50:05,774 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=209, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2025-03-04 09:50:05,775 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2025-03-04 09:50:05,775 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 209 flow [2025-03-04 09:50:05,775 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:05,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:50:05,776 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:05,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:50:05,776 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:05,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:50:05,776 INFO L85 PathProgramCache]: Analyzing trace with hash -501077819, now seen corresponding path program 1 times [2025-03-04 09:50:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:50:05,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712588514] [2025-03-04 09:50:05,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:50:05,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:50:05,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:50:05,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:50:05,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:50:05,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:06,123 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:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:06,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712588514] [2025-03-04 09:50:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712588514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:06,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:50:06,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254484203] [2025-03-04 09:50:06,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:06,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:50:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:06,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:50:06,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:50:06,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 09:50:06,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 49 transitions, 209 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:06,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:06,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 09:50:06,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:50:10,847 INFO L124 PetriNetUnfolderBase]: 46883/64387 cut-off events. [2025-03-04 09:50:10,848 INFO L125 PetriNetUnfolderBase]: For 102663/102663 co-relation queries the response was YES. [2025-03-04 09:50:11,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199235 conditions, 64387 events. 46883/64387 cut-off events. For 102663/102663 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 403256 event pairs, 13587 based on Foata normal form. 1254/65626 useless extension candidates. Maximal degree in co-relation 199217. Up to 50935 conditions per place. [2025-03-04 09:50:11,281 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 62 selfloop transitions, 3 changer transitions 75/146 dead transitions. [2025-03-04 09:50:11,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 146 transitions, 909 flow [2025-03-04 09:50:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:50:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:50:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2025-03-04 09:50:11,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5343915343915344 [2025-03-04 09:50:11,282 INFO L175 Difference]: Start difference. First operand has 75 places, 49 transitions, 209 flow. Second operand 7 states and 202 transitions. [2025-03-04 09:50:11,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 146 transitions, 909 flow [2025-03-04 09:50:12,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 146 transitions, 840 flow, removed 33 selfloop flow, removed 5 redundant places. [2025-03-04 09:50:12,866 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 222 flow [2025-03-04 09:50:12,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-03-04 09:50:12,866 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2025-03-04 09:50:12,867 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 222 flow [2025-03-04 09:50:12,867 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-04 09:50:12,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:50:12,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:50:12,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:50:12,867 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:12,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:50:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1984007195, now seen corresponding path program 1 times [2025-03-04 09:50:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:50:12,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750221427] [2025-03-04 09:50:12,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:50:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:50:12,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:50:12,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:50:12,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:50:12,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:13,052 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:13,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750221427] [2025-03-04 09:50:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750221427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:50:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105162237] [2025-03-04 09:50:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:13,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:50:13,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:13,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:50:13,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:50:13,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-03-04 09:50:13,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:13,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:13,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-03-04 09:50:13,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:50:16,535 INFO L124 PetriNetUnfolderBase]: 37165/51683 cut-off events. [2025-03-04 09:50:16,535 INFO L125 PetriNetUnfolderBase]: For 71491/71498 co-relation queries the response was YES. [2025-03-04 09:50:16,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157231 conditions, 51683 events. 37165/51683 cut-off events. For 71491/71498 co-relation queries the response was YES. Maximal size of possible extension queue 1486. Compared 325019 event pairs, 4629 based on Foata normal form. 1692/53339 useless extension candidates. Maximal degree in co-relation 157211. Up to 28795 conditions per place. [2025-03-04 09:50:16,893 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 100 selfloop transitions, 6 changer transitions 1/113 dead transitions. [2025-03-04 09:50:16,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 113 transitions, 728 flow [2025-03-04 09:50:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:50:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:50:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-03-04 09:50:16,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-04 09:50:16,895 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 222 flow. Second operand 4 states and 132 transitions. [2025-03-04 09:50:16,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 113 transitions, 728 flow [2025-03-04 09:50:17,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 113 transitions, 705 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 09:50:17,124 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 253 flow [2025-03-04 09:50:17,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2025-03-04 09:50:17,124 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2025-03-04 09:50:17,124 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 253 flow [2025-03-04 09:50:17,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:17,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:50:17,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:50:17,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:50:17,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:50:17,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:50:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1510465137, now seen corresponding path program 1 times [2025-03-04 09:50:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:50:17,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481294626] [2025-03-04 09:50:17,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:50:17,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:50:17,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:50:17,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:50:17,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:50:17,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:17,762 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:17,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:17,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481294626] [2025-03-04 09:50:17,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481294626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:17,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:17,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:50:17,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653483243] [2025-03-04 09:50:17,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:17,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:50:17,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:17,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:50:17,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:50:17,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-03-04 09:50:17,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 253 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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:17,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:17,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-03-04 09:50:17,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand