./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d6df98e8ac4880739ff8c7fa9cf00b32c56a4c64770b2bc9bcfef3d013872fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:08:59,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:08:59,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:08:59,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:08:59,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:08:59,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:08:59,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:08:59,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:08:59,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:08:59,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:08:59,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:08:59,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:08:59,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:08:59,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:08:59,448 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:08:59,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:08:59,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:08:59,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:08:59,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:08:59,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:08:59,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:08:59,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:08:59,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:08:59,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:08:59,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:08:59,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:08:59,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:08:59,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:08:59,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:08:59,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:08:59,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:08:59,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:08:59,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:08:59,451 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 ! call(reach_error())) ) 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 -> 9d6df98e8ac4880739ff8c7fa9cf00b32c56a4c64770b2bc9bcfef3d013872fa [2025-03-04 02:08:59,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:08:59,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:08:59,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:08:59,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:08:59,695 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:08:59,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 02:09:00,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa222c4f/13d7c2d1f68d4eed93cafd98ea732b9b/FLAG6775bc6ea [2025-03-04 02:09:01,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:09:01,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 02:09:01,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa222c4f/13d7c2d1f68d4eed93cafd98ea732b9b/FLAG6775bc6ea [2025-03-04 02:09:01,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa222c4f/13d7c2d1f68d4eed93cafd98ea732b9b [2025-03-04 02:09:01,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:09:01,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:09:01,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:09:01,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:09:01,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:09:01,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcbe7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01, skipping insertion in model container [2025-03-04 02:09:01,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:09:01,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2025-03-04 02:09:01,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:09:01,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:09:01,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2025-03-04 02:09:01,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:09:01,754 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:09:01,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01 WrapperNode [2025-03-04 02:09:01,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:09:01,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:09:01,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:09:01,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:09:01,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,795 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2025-03-04 02:09:01,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:09:01,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:09:01,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:09:01,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:09:01,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,822 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 02:09:01,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:09:01,843 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:09:01,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:09:01,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:09:01,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (1/1) ... [2025-03-04 02:09:01,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:09:01,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:09:01,880 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 02:09:01,883 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 02:09:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:09:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:09:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 02:09:01,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 02:09:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 02:09:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 02:09:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:09:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:09:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:09:01,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:09:01,904 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 02:09:01,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:09:01,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:09:02,313 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:09:02,313 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:09:02,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:09:02,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:09:02,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:09:02 BoogieIcfgContainer [2025-03-04 02:09:02,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:09:02,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:09:02,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:09:02,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:09:02,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:09:01" (1/3) ... [2025-03-04 02:09:02,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15870ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:09:02, skipping insertion in model container [2025-03-04 02:09:02,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:01" (2/3) ... [2025-03-04 02:09:02,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15870ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:09:02, skipping insertion in model container [2025-03-04 02:09:02,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:09:02" (3/3) ... [2025-03-04 02:09:02,556 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 02:09:02,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:09:02,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 33 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 02:09:02,569 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:09:02,613 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:09:02,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 74 flow [2025-03-04 02:09:02,673 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2025-03-04 02:09:02,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:09:02,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-03-04 02:09:02,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 74 flow [2025-03-04 02:09:02,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 68 flow [2025-03-04 02:09:02,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:09:02,707 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=LoopHeads, 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;@57ba2e61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:09:02,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:09:02,713 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:09:02,713 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 02:09:02,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:09:02,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:02,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:09:02,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:02,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash -901724701, now seen corresponding path program 1 times [2025-03-04 02:09:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476228712] [2025-03-04 02:09:02,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:02,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:09:02,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:09:02,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:03,097 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 02:09:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:03,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476228712] [2025-03-04 02:09:03,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476228712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:03,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:03,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 02:09:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118658888] [2025-03-04 02:09:03,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:03,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:09:03,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:03,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:09:03,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:09:03,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 02:09:03,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 02:09:03,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:03,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 02:09:03,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:03,433 INFO L124 PetriNetUnfolderBase]: 733/1220 cut-off events. [2025-03-04 02:09:03,434 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 02:09:03,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 1220 events. 733/1220 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5650 event pairs, 54 based on Foata normal form. 56/1266 useless extension candidates. Maximal degree in co-relation 2426. Up to 1072 conditions per place. [2025-03-04 02:09:03,445 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2025-03-04 02:09:03,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 164 flow [2025-03-04 02:09:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:09:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:09:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-04 02:09:03,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2025-03-04 02:09:03,457 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 61 transitions. [2025-03-04 02:09:03,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 164 flow [2025-03-04 02:09:03,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:09:03,464 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-03-04 02:09:03,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-04 02:09:03,469 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-03-04 02:09:03,469 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-03-04 02:09:03,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 02:09:03,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:03,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:03,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:09:03,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:03,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1806302657, now seen corresponding path program 1 times [2025-03-04 02:09:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:03,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159001267] [2025-03-04 02:09:03,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:03,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:09:03,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:09:03,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:03,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:04,056 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 02:09:04,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:04,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159001267] [2025-03-04 02:09:04,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159001267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:04,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:04,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:09:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036400641] [2025-03-04 02:09:04,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:04,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:09:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:04,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:09:04,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:09:04,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:09:04,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 02:09:04,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:04,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:09:04,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:04,527 INFO L124 PetriNetUnfolderBase]: 930/1571 cut-off events. [2025-03-04 02:09:04,528 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 02:09:04,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3180 conditions, 1571 events. 930/1571 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7526 event pairs, 236 based on Foata normal form. 0/1533 useless extension candidates. Maximal degree in co-relation 3170. Up to 745 conditions per place. [2025-03-04 02:09:04,534 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 32 selfloop transitions, 2 changer transitions 54/91 dead transitions. [2025-03-04 02:09:04,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 91 transitions, 370 flow [2025-03-04 02:09:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:09:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:09:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-03-04 02:09:04,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2025-03-04 02:09:04,537 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 8 states and 130 transitions. [2025-03-04 02:09:04,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 91 transitions, 370 flow [2025-03-04 02:09:04,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 91 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:09:04,542 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 74 flow [2025-03-04 02:09:04,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2025-03-04 02:09:04,543 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2025-03-04 02:09:04,543 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 74 flow [2025-03-04 02:09:04,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 02:09:04,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:04,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:04,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:09:04,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:04,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash -488012376, now seen corresponding path program 1 times [2025-03-04 02:09:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335316189] [2025-03-04 02:09:04,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:04,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:04,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:09:04,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:09:04,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:04,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:04,927 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 02:09:04,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:04,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335316189] [2025-03-04 02:09:04,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335316189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:04,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:09:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988046235] [2025-03-04 02:09:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:04,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:09:04,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:04,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:09:04,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:09:04,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:09:04,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 02:09:04,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:04,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:09:04,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:05,269 INFO L124 PetriNetUnfolderBase]: 631/1079 cut-off events. [2025-03-04 02:09:05,269 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2025-03-04 02:09:05,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 1079 events. 631/1079 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4811 event pairs, 211 based on Foata normal form. 35/1111 useless extension candidates. Maximal degree in co-relation 2400. Up to 598 conditions per place. [2025-03-04 02:09:05,273 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 35 selfloop transitions, 2 changer transitions 31/71 dead transitions. [2025-03-04 02:09:05,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 313 flow [2025-03-04 02:09:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:09:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:09:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2025-03-04 02:09:05,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-04 02:09:05,275 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 74 flow. Second operand 7 states and 105 transitions. [2025-03-04 02:09:05,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 313 flow [2025-03-04 02:09:05,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 71 transitions, 291 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 02:09:05,278 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 78 flow [2025-03-04 02:09:05,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2025-03-04 02:09:05,279 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2025-03-04 02:09:05,279 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 78 flow [2025-03-04 02:09:05,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 02:09:05,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:05,279 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 02:09:05,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:09:05,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:05,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:05,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1930322136, now seen corresponding path program 1 times [2025-03-04 02:09:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:05,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690893122] [2025-03-04 02:09:05,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:05,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:09:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:09:05,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:05,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:06,177 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 02:09:06,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:06,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690893122] [2025-03-04 02:09:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690893122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:06,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:06,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:09:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845143552] [2025-03-04 02:09:06,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:06,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:09:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:06,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:09:06,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:09:06,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:09:06,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 78 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 02:09:06,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:06,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:09:06,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:06,672 INFO L124 PetriNetUnfolderBase]: 708/1204 cut-off events. [2025-03-04 02:09:06,672 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2025-03-04 02:09:06,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 1204 events. 708/1204 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5229 event pairs, 145 based on Foata normal form. 24/1225 useless extension candidates. Maximal degree in co-relation 2732. Up to 750 conditions per place. [2025-03-04 02:09:06,678 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 45 selfloop transitions, 10 changer transitions 27/85 dead transitions. [2025-03-04 02:09:06,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 379 flow [2025-03-04 02:09:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:09:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:09:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2025-03-04 02:09:06,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-03-04 02:09:06,680 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 78 flow. Second operand 10 states and 134 transitions. [2025-03-04 02:09:06,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 379 flow [2025-03-04 02:09:06,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 85 transitions, 355 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 02:09:06,683 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 152 flow [2025-03-04 02:09:06,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-03-04 02:09:06,684 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2025-03-04 02:09:06,684 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 152 flow [2025-03-04 02:09:06,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 02:09:06,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:06,684 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 02:09:06,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:09:06,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:06,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash 716793614, now seen corresponding path program 2 times [2025-03-04 02:09:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:06,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319752592] [2025-03-04 02:09:06,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:09:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:06,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:09:06,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:09:06,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:09:06,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:06,921 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 02:09:06,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:06,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319752592] [2025-03-04 02:09:06,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319752592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:06,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:06,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:09:06,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425065381] [2025-03-04 02:09:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:06,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:09:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:06,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:09:06,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:09:06,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 02:09:06,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 02:09:06,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:06,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 02:09:06,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:07,114 INFO L124 PetriNetUnfolderBase]: 455/829 cut-off events. [2025-03-04 02:09:07,114 INFO L125 PetriNetUnfolderBase]: For 776/776 co-relation queries the response was YES. [2025-03-04 02:09:07,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 829 events. 455/829 cut-off events. For 776/776 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3577 event pairs, 128 based on Foata normal form. 70/896 useless extension candidates. Maximal degree in co-relation 2415. Up to 301 conditions per place. [2025-03-04 02:09:07,119 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 58 selfloop transitions, 4 changer transitions 1/67 dead transitions. [2025-03-04 02:09:07,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 426 flow [2025-03-04 02:09:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:09:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:09:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-03-04 02:09:07,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-03-04 02:09:07,123 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 152 flow. Second operand 4 states and 81 transitions. [2025-03-04 02:09:07,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 426 flow [2025-03-04 02:09:07,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 421 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:09:07,126 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 173 flow [2025-03-04 02:09:07,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-04 02:09:07,127 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2025-03-04 02:09:07,127 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 173 flow [2025-03-04 02:09:07,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 02:09:07,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:07,127 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 02:09:07,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:09:07,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:07,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash 477166595, now seen corresponding path program 1 times [2025-03-04 02:09:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:07,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425531145] [2025-03-04 02:09:07,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:07,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:07,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:09:07,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:09:07,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:07,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:07,333 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 02:09:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425531145] [2025-03-04 02:09:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425531145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:09:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055352462] [2025-03-04 02:09:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:09:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:07,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:09:07,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:09:07,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 02:09:07,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 02:09:07,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:07,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 02:09:07,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:07,472 INFO L124 PetriNetUnfolderBase]: 248/464 cut-off events. [2025-03-04 02:09:07,472 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-03-04 02:09:07,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 464 events. 248/464 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1689 event pairs, 84 based on Foata normal form. 30/491 useless extension candidates. Maximal degree in co-relation 1463. Up to 194 conditions per place. [2025-03-04 02:09:07,475 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 46 selfloop transitions, 6 changer transitions 1/57 dead transitions. [2025-03-04 02:09:07,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 365 flow [2025-03-04 02:09:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:09:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:09:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-04 02:09:07,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-04 02:09:07,477 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 173 flow. Second operand 5 states and 80 transitions. [2025-03-04 02:09:07,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 365 flow [2025-03-04 02:09:07,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 338 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:09:07,481 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 173 flow [2025-03-04 02:09:07,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2025-03-04 02:09:07,483 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2025-03-04 02:09:07,483 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 173 flow [2025-03-04 02:09:07,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 02:09:07,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:07,483 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 02:09:07,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:09:07,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:07,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1132152229, now seen corresponding path program 1 times [2025-03-04 02:09:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238789056] [2025-03-04 02:09:07,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:07,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:07,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:09:07,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:09:07,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:07,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:08,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-04 02:09:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:08,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238789056] [2025-03-04 02:09:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238789056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:08,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:08,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:09:08,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313152026] [2025-03-04 02:09:08,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:08,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:09:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:08,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:09:08,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:09:08,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:09:08,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 173 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 02:09:08,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:08,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:09:08,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:08,483 INFO L124 PetriNetUnfolderBase]: 294/554 cut-off events. [2025-03-04 02:09:08,485 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-03-04 02:09:08,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 554 events. 294/554 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2098 event pairs, 68 based on Foata normal form. 4/555 useless extension candidates. Maximal degree in co-relation 1715. Up to 246 conditions per place. [2025-03-04 02:09:08,488 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 48 selfloop transitions, 17 changer transitions 16/84 dead transitions. [2025-03-04 02:09:08,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 541 flow [2025-03-04 02:09:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:09:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:09:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2025-03-04 02:09:08,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2025-03-04 02:09:08,489 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 173 flow. Second operand 10 states and 124 transitions. [2025-03-04 02:09:08,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 541 flow [2025-03-04 02:09:08,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 444 flow, removed 28 selfloop flow, removed 8 redundant places. [2025-03-04 02:09:08,493 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 249 flow [2025-03-04 02:09:08,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=249, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2025-03-04 02:09:08,494 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2025-03-04 02:09:08,494 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 249 flow [2025-03-04 02:09:08,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 02:09:08,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:08,495 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 02:09:08,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:09:08,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:08,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1327284817, now seen corresponding path program 2 times [2025-03-04 02:09:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:08,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35487602] [2025-03-04 02:09:08,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:09:08,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:08,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:09:08,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:09:08,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:09:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:08,879 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 02:09:08,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:08,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35487602] [2025-03-04 02:09:08,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35487602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:08,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:08,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:09:08,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135137404] [2025-03-04 02:09:08,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:08,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:09:08,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:08,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:09:08,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:09:08,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:09:08,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 02:09:08,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:08,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:09:08,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:09,123 INFO L124 PetriNetUnfolderBase]: 330/622 cut-off events. [2025-03-04 02:09:09,124 INFO L125 PetriNetUnfolderBase]: For 711/711 co-relation queries the response was YES. [2025-03-04 02:09:09,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 622 events. 330/622 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2492 event pairs, 134 based on Foata normal form. 4/623 useless extension candidates. Maximal degree in co-relation 1937. Up to 282 conditions per place. [2025-03-04 02:09:09,129 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 34 selfloop transitions, 6 changer transitions 32/75 dead transitions. [2025-03-04 02:09:09,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 517 flow [2025-03-04 02:09:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:09:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:09:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-03-04 02:09:09,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-04 02:09:09,130 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 249 flow. Second operand 6 states and 84 transitions. [2025-03-04 02:09:09,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 517 flow [2025-03-04 02:09:09,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 501 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 02:09:09,133 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 218 flow [2025-03-04 02:09:09,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2025-03-04 02:09:09,136 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2025-03-04 02:09:09,137 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 218 flow [2025-03-04 02:09:09,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 02:09:09,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:09,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, 1, 1, 1, 1, 1] [2025-03-04 02:09:09,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:09:09,137 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:09,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -44152217, now seen corresponding path program 3 times [2025-03-04 02:09:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:09,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239366922] [2025-03-04 02:09:09,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:09:09,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:09,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:09:09,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:09:09,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:09:09,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:10,371 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 02:09:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:10,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239366922] [2025-03-04 02:09:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239366922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:10,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:09:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276257458] [2025-03-04 02:09:10,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:10,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:09:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:10,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:09:10,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:09:10,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:09:10,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 218 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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 02:09:10,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:10,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:09:10,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:10,763 INFO L124 PetriNetUnfolderBase]: 234/461 cut-off events. [2025-03-04 02:09:10,764 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2025-03-04 02:09:10,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 461 events. 234/461 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1643 event pairs, 54 based on Foata normal form. 4/463 useless extension candidates. Maximal degree in co-relation 1390. Up to 274 conditions per place. [2025-03-04 02:09:10,766 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 34 selfloop transitions, 12 changer transitions 23/72 dead transitions. [2025-03-04 02:09:10,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 471 flow [2025-03-04 02:09:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:09:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:09:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-04 02:09:10,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2025-03-04 02:09:10,767 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 218 flow. Second operand 9 states and 105 transitions. [2025-03-04 02:09:10,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 471 flow [2025-03-04 02:09:10,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 420 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-04 02:09:10,770 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 207 flow [2025-03-04 02:09:10,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=207, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2025-03-04 02:09:10,770 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2025-03-04 02:09:10,770 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 207 flow [2025-03-04 02:09:10,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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 02:09:10,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:10,771 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 02:09:10,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:09:10,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:10,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2113166025, now seen corresponding path program 4 times [2025-03-04 02:09:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894216727] [2025-03-04 02:09:10,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:09:10,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:10,779 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:09:10,853 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:09:10,854 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:09:10,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:11,239 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 02:09:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:11,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894216727] [2025-03-04 02:09:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894216727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:09:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450370943] [2025-03-04 02:09:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:11,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:09:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:11,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:09:11,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:09:11,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:09:11,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 37 transitions, 207 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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 02:09:11,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:11,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:09:11,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:11,472 INFO L124 PetriNetUnfolderBase]: 176/357 cut-off events. [2025-03-04 02:09:11,473 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2025-03-04 02:09:11,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 357 events. 176/357 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1171 event pairs, 97 based on Foata normal form. 4/359 useless extension candidates. Maximal degree in co-relation 1124. Up to 172 conditions per place. [2025-03-04 02:09:11,474 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 31 selfloop transitions, 3 changer transitions 34/71 dead transitions. [2025-03-04 02:09:11,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 492 flow [2025-03-04 02:09:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:09:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:09:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2025-03-04 02:09:11,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-03-04 02:09:11,476 INFO L175 Difference]: Start difference. First operand has 59 places, 37 transitions, 207 flow. Second operand 9 states and 110 transitions. [2025-03-04 02:09:11,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 492 flow [2025-03-04 02:09:11,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 436 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-04 02:09:11,479 INFO L231 Difference]: Finished difference. Result has 61 places, 34 transitions, 169 flow [2025-03-04 02:09:11,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=169, PETRI_PLACES=61, PETRI_TRANSITIONS=34} [2025-03-04 02:09:11,480 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-03-04 02:09:11,481 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 34 transitions, 169 flow [2025-03-04 02:09:11,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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 02:09:11,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:11,481 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 02:09:11,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:09:11,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:11,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash 235382503, now seen corresponding path program 5 times [2025-03-04 02:09:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:11,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593537267] [2025-03-04 02:09:11,483 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:09:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:11,490 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:09:11,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:09:11,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:09:11,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:12,175 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 02:09:12,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:12,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593537267] [2025-03-04 02:09:12,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593537267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:12,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:12,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:09:12,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272866176] [2025-03-04 02:09:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:12,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:09:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:12,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:09:12,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:09:12,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:09:12,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 34 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-04 02:09:12,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:12,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:09:12,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:12,422 INFO L124 PetriNetUnfolderBase]: 127/264 cut-off events. [2025-03-04 02:09:12,422 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-04 02:09:12,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 264 events. 127/264 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 773 event pairs, 64 based on Foata normal form. 4/267 useless extension candidates. Maximal degree in co-relation 730. Up to 125 conditions per place. [2025-03-04 02:09:12,423 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 25 selfloop transitions, 4 changer transitions 20/52 dead transitions. [2025-03-04 02:09:12,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 316 flow [2025-03-04 02:09:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:09:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:09:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2025-03-04 02:09:12,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2025-03-04 02:09:12,424 INFO L175 Difference]: Start difference. First operand has 61 places, 34 transitions, 169 flow. Second operand 8 states and 84 transitions. [2025-03-04 02:09:12,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 316 flow [2025-03-04 02:09:12,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 288 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-03-04 02:09:12,426 INFO L231 Difference]: Finished difference. Result has 54 places, 29 transitions, 122 flow [2025-03-04 02:09:12,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=29} [2025-03-04 02:09:12,426 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2025-03-04 02:09:12,426 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 29 transitions, 122 flow [2025-03-04 02:09:12,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-04 02:09:12,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:12,427 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 02:09:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:09:12,427 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:09:12,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash 453670241, now seen corresponding path program 6 times [2025-03-04 02:09:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443628170] [2025-03-04 02:09:12,428 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:09:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:12,434 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:09:12,450 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:09:12,450 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:09:12,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:13,167 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 02:09:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443628170] [2025-03-04 02:09:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443628170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:13,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:09:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082968904] [2025-03-04 02:09:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:13,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:09:13,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:13,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:09:13,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:09:13,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:09:13,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 29 transitions, 122 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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 02:09:13,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:13,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:09:13,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:13,444 INFO L124 PetriNetUnfolderBase]: 69/146 cut-off events. [2025-03-04 02:09:13,444 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-03-04 02:09:13,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 146 events. 69/146 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 299 event pairs, 24 based on Foata normal form. 4/149 useless extension candidates. Maximal degree in co-relation 404. Up to 88 conditions per place. [2025-03-04 02:09:13,445 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 0 selfloop transitions, 0 changer transitions 36/36 dead transitions. [2025-03-04 02:09:13,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 36 transitions, 202 flow [2025-03-04 02:09:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:09:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:09:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2025-03-04 02:09:13,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2765151515151515 [2025-03-04 02:09:13,446 INFO L175 Difference]: Start difference. First operand has 54 places, 29 transitions, 122 flow. Second operand 8 states and 73 transitions. [2025-03-04 02:09:13,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 36 transitions, 202 flow [2025-03-04 02:09:13,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 175 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-03-04 02:09:13,447 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2025-03-04 02:09:13,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2025-03-04 02:09:13,447 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2025-03-04 02:09:13,447 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2025-03-04 02:09:13,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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 02:09:13,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-03-04 02:09:13,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-04 02:09:13,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-04 02:09:13,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-04 02:09:13,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-04 02:09:13,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:09:13,451 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1] [2025-03-04 02:09:13,455 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:09:13,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:09:13,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:09:13 BasicIcfg [2025-03-04 02:09:13,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:09:13,460 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:09:13,460 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:09:13,460 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:09:13,461 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:09:02" (3/4) ... [2025-03-04 02:09:13,462 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:09:13,465 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-04 02:09:13,465 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-04 02:09:13,469 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-03-04 02:09:13,470 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 02:09:13,470 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 02:09:13,470 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 02:09:13,527 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:09:13,528 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:09:13,528 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:09:13,528 INFO L158 Benchmark]: Toolchain (without parser) took 12121.54ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 111.4MB in the beginning and 472.9MB in the end (delta: -361.6MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2025-03-04 02:09:13,528 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:09:13,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.14ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 85.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:09:13,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.54ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 83.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:09:13,529 INFO L158 Benchmark]: Boogie Preprocessor took 46.58ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 79.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:09:13,529 INFO L158 Benchmark]: IcfgBuilder took 704.37ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 69.1MB in the end (delta: 10.0MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2025-03-04 02:09:13,529 INFO L158 Benchmark]: TraceAbstraction took 10909.95ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 69.1MB in the beginning and 477.2MB in the end (delta: -408.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:09:13,529 INFO L158 Benchmark]: Witness Printer took 67.50ms. Allocated memory is still 545.3MB. Free memory was 477.2MB in the beginning and 472.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:09:13,531 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.14ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 85.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.54ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 83.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.58ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 79.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 704.37ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 69.1MB in the end (delta: 10.0MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10909.95ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 69.1MB in the beginning and 477.2MB in the end (delta: -408.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.50ms. Allocated memory is still 545.3MB. Free memory was 477.2MB in the beginning and 472.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 561 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 137 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2009 IncrementalHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 16 mSDtfsCounter, 2009 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=7, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 2146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:09:13,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE