./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-barrier.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:40:54,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:40:54,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:40:54,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:40:54,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:40:54,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:40:54,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:40:54,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:40:54,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:40:54,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:40:54,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:40:54,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:40:54,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:40:54,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:40:54,102 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:40:54,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:40:54,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:40:54,102 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:40:54,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:40:54,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:40:54,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:40:54,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:40:54,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:40:54,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:40:54,103 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:40:54,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:40:54,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:40:54,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:40:54,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:40:54,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:40:54,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:40:54,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:40:54,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:54,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:40:54,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:40:54,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:40:54,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:40:54,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:54,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:40:54,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:40:54,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:40:54,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:40:54,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:40:54,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:40:54,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:40:54,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:40:54,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:40:54,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:40:54,105 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-jdk21/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 -> b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c [2025-01-09 16:40:54,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:40:54,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:40:54,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:40:54,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:40:54,334 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:40:54,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-01-09 16:40:55,497 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1967fd411/47d6636b90214846a4fc92b8cc8e098e/FLAG85226c72d [2025-01-09 16:40:55,799 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:40:55,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-01-09 16:40:55,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1967fd411/47d6636b90214846a4fc92b8cc8e098e/FLAG85226c72d [2025-01-09 16:40:55,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1967fd411/47d6636b90214846a4fc92b8cc8e098e [2025-01-09 16:40:55,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:40:55,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:40:55,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:40:55,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:40:55,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:40:55,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:55" (1/1) ... [2025-01-09 16:40:55,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321e4ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:55, skipping insertion in model container [2025-01-09 16:40:55,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:55" (1/1) ... [2025-01-09 16:40:55,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:40:55,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c[3418,3431] [2025-01-09 16:40:55,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:40:55,988 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:40:56,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c[3418,3431] [2025-01-09 16:40:56,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:40:56,024 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:40:56,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56 WrapperNode [2025-01-09 16:40:56,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:40:56,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:40:56,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:40:56,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:40:56,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,061 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 210 [2025-01-09 16:40:56,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:40:56,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:40:56,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:40:56,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:40:56,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,093 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-01-09 16:40:56,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:40:56,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:40:56,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:40:56,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:40:56,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (1/1) ... [2025-01-09 16:40:56,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:56,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:40:56,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:40:56,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-09 16:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-09 16:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-01-09 16:40:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-01-09 16:40:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:40:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:40:56,167 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:40:56,239 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:40:56,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:40:56,432 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:40:56,432 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:40:56,619 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:40:56,619 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:40:56,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:56 BoogieIcfgContainer [2025-01-09 16:40:56,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:40:56,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:40:56,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:40:56,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:40:56,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:40:55" (1/3) ... [2025-01-09 16:40:56,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1094e813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:56, skipping insertion in model container [2025-01-09 16:40:56,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:56" (2/3) ... [2025-01-09 16:40:56,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1094e813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:56, skipping insertion in model container [2025-01-09 16:40:56,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:56" (3/3) ... [2025-01-09 16:40:56,629 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2025-01-09 16:40:56,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:40:56,641 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier.wvr.c that has 7 procedures, 73 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 16:40:56,641 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:40:56,725 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-01-09 16:40:56,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 82 transitions, 230 flow [2025-01-09 16:40:56,801 INFO L124 PetriNetUnfolderBase]: 4/70 cut-off events. [2025-01-09 16:40:56,802 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:40:56,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 70 events. 4/70 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 118 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-01-09 16:40:56,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 82 transitions, 230 flow [2025-01-09 16:40:56,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 69 transitions, 186 flow [2025-01-09 16:40:56,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:40:56,826 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;@787fbc37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:40:56,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 16:40:56,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:40:56,856 INFO L124 PetriNetUnfolderBase]: 4/68 cut-off events. [2025-01-09 16:40:56,856 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:40:56,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:56,857 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:40:56,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 16:40:56,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1393916505, now seen corresponding path program 1 times [2025-01-09 16:40:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:56,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296874744] [2025-01-09 16:40:56,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:56,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 16:40:56,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 16:40:56,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:56,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296874744] [2025-01-09 16:40:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296874744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:57,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:57,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:40:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228530384] [2025-01-09 16:40:57,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:57,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:40:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:57,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:40:57,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:40:57,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 86 [2025-01-09 16:40:57,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-09 16:40:57,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:57,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 86 [2025-01-09 16:40:57,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:58,813 INFO L124 PetriNetUnfolderBase]: 14053/19607 cut-off events. [2025-01-09 16:40:58,814 INFO L125 PetriNetUnfolderBase]: For 1988/1988 co-relation queries the response was YES. [2025-01-09 16:40:58,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41191 conditions, 19607 events. 14053/19607 cut-off events. For 1988/1988 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 111288 event pairs, 8277 based on Foata normal form. 480/19128 useless extension candidates. Maximal degree in co-relation 40794. Up to 13270 conditions per place. [2025-01-09 16:40:58,995 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 67 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-01-09 16:40:58,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 90 transitions, 391 flow [2025-01-09 16:40:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:40:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:40:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-01-09 16:40:59,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5697674418604651 [2025-01-09 16:40:59,007 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 186 flow. Second operand 3 states and 147 transitions. [2025-01-09 16:40:59,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 90 transitions, 391 flow [2025-01-09 16:40:59,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 345 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-09 16:40:59,087 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 168 flow [2025-01-09 16:40:59,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-01-09 16:40:59,093 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-01-09 16:40:59,093 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 168 flow [2025-01-09 16:40:59,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-09 16:40:59,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:59,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:40:59,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:40:59,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 16:40:59,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1117834938, now seen corresponding path program 1 times [2025-01-09 16:40:59,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:59,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770459703] [2025-01-09 16:40:59,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:59,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:59,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 16:40:59,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 16:40:59,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:59,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770459703] [2025-01-09 16:40:59,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770459703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:59,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:59,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:40:59,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526686539] [2025-01-09 16:40:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:59,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:40:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:59,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:40:59,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:40:59,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 86 [2025-01-09 16:40:59,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-09 16:40:59,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:59,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 86 [2025-01-09 16:40:59,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:00,683 INFO L124 PetriNetUnfolderBase]: 13081/19085 cut-off events. [2025-01-09 16:41:00,683 INFO L125 PetriNetUnfolderBase]: For 1234/1234 co-relation queries the response was YES. [2025-01-09 16:41:00,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37939 conditions, 19085 events. 13081/19085 cut-off events. For 1234/1234 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 118255 event pairs, 7989 based on Foata normal form. 316/18251 useless extension candidates. Maximal degree in co-relation 16196. Up to 13117 conditions per place. [2025-01-09 16:41:00,751 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 68 selfloop transitions, 4 changer transitions 0/91 dead transitions. [2025-01-09 16:41:00,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 369 flow [2025-01-09 16:41:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:41:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:41:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-01-09 16:41:00,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5736434108527132 [2025-01-09 16:41:00,753 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 168 flow. Second operand 3 states and 148 transitions. [2025-01-09 16:41:00,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 369 flow [2025-01-09 16:41:00,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:00,759 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 174 flow [2025-01-09 16:41:00,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2025-01-09 16:41:00,763 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2025-01-09 16:41:00,763 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 174 flow [2025-01-09 16:41:00,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-09 16:41:00,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:00,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:00,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:41:00,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 16:41:00,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1579026690, now seen corresponding path program 2 times [2025-01-09 16:41:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842228216] [2025-01-09 16:41:00,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:41:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:00,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 1 equivalence classes. [2025-01-09 16:41:00,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 16:41:00,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:41:00,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:00,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:00,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842228216] [2025-01-09 16:41:00,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842228216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:00,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:41:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612816066] [2025-01-09 16:41:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:00,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:41:00,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:00,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:41:00,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:41:00,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 86 [2025-01-09 16:41:00,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-09 16:41:00,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:00,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 86 [2025-01-09 16:41:00,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:01,753 INFO L124 PetriNetUnfolderBase]: 11919/17063 cut-off events. [2025-01-09 16:41:01,753 INFO L125 PetriNetUnfolderBase]: For 1688/1716 co-relation queries the response was YES. [2025-01-09 16:41:01,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35062 conditions, 17063 events. 11919/17063 cut-off events. For 1688/1716 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 99863 event pairs, 7037 based on Foata normal form. 348/16362 useless extension candidates. Maximal degree in co-relation 12583. Up to 11081 conditions per place. [2025-01-09 16:41:01,820 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 69 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2025-01-09 16:41:01,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 379 flow [2025-01-09 16:41:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:41:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:41:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-01-09 16:41:01,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5775193798449613 [2025-01-09 16:41:01,826 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 174 flow. Second operand 3 states and 149 transitions. [2025-01-09 16:41:01,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 379 flow [2025-01-09 16:41:01,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:01,829 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 180 flow [2025-01-09 16:41:01,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2025-01-09 16:41:01,830 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2025-01-09 16:41:01,830 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 180 flow [2025-01-09 16:41:01,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-09 16:41:01,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:01,830 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:01,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:41:01,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 16:41:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1751838118, now seen corresponding path program 3 times [2025-01-09 16:41:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174899648] [2025-01-09 16:41:01,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:41:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:01,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 1 equivalence classes. [2025-01-09 16:41:01,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 16:41:01,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:41:01,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:02,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:02,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174899648] [2025-01-09 16:41:02,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174899648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:02,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:02,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 16:41:02,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070938690] [2025-01-09 16:41:02,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:02,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:41:02,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:02,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:41:02,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:41:02,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 86 [2025-01-09 16:41:02,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 180 flow. Second operand has 20 states, 20 states have (on average 18.75) internal successors, (375), 20 states have internal predecessors, (375), 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-01-09 16:41:02,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:02,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 86 [2025-01-09 16:41:02,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:08,880 INFO L124 PetriNetUnfolderBase]: 57138/76185 cut-off events. [2025-01-09 16:41:08,880 INFO L125 PetriNetUnfolderBase]: For 9138/9138 co-relation queries the response was YES. [2025-01-09 16:41:08,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159492 conditions, 76185 events. 57138/76185 cut-off events. For 9138/9138 co-relation queries the response was YES. Maximal size of possible extension queue 1351. Compared 416243 event pairs, 5441 based on Foata normal form. 1/73356 useless extension candidates. Maximal degree in co-relation 63161. Up to 36443 conditions per place. [2025-01-09 16:41:09,150 INFO L140 encePairwiseOnDemand]: 64/86 looper letters, 521 selfloop transitions, 200 changer transitions 20/751 dead transitions. [2025-01-09 16:41:09,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 751 transitions, 3271 flow [2025-01-09 16:41:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 16:41:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-01-09 16:41:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 1654 transitions. [2025-01-09 16:41:09,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33741330069359443 [2025-01-09 16:41:09,159 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 180 flow. Second operand 57 states and 1654 transitions. [2025-01-09 16:41:09,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 751 transitions, 3271 flow [2025-01-09 16:41:09,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 751 transitions, 3235 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:09,190 INFO L231 Difference]: Finished difference. Result has 158 places, 292 transitions, 1380 flow [2025-01-09 16:41:09,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=1380, PETRI_PLACES=158, PETRI_TRANSITIONS=292} [2025-01-09 16:41:09,191 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 74 predicate places. [2025-01-09 16:41:09,191 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 292 transitions, 1380 flow [2025-01-09 16:41:09,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 18.75) internal successors, (375), 20 states have internal predecessors, (375), 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-01-09 16:41:09,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:09,192 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:41:09,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 16:41:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1986151880, now seen corresponding path program 4 times [2025-01-09 16:41:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341532603] [2025-01-09 16:41:09,193 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:41:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:09,205 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-01-09 16:41:09,220 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 16:41:09,220 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:41:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:09,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341532603] [2025-01-09 16:41:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341532603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:09,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:41:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539678557] [2025-01-09 16:41:09,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:09,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:41:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:09,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:41:09,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:41:09,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 86 [2025-01-09 16:41:09,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 292 transitions, 1380 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-09 16:41:09,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:09,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 86 [2025-01-09 16:41:09,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:12,226 INFO L124 PetriNetUnfolderBase]: 27704/40051 cut-off events. [2025-01-09 16:41:12,227 INFO L125 PetriNetUnfolderBase]: For 86602/87398 co-relation queries the response was YES. [2025-01-09 16:41:12,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113412 conditions, 40051 events. 27704/40051 cut-off events. For 86602/87398 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 256052 event pairs, 13088 based on Foata normal form. 1406/38659 useless extension candidates. Maximal degree in co-relation 113367. Up to 26051 conditions per place. [2025-01-09 16:41:12,510 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 140 selfloop transitions, 4 changer transitions 0/300 dead transitions. [2025-01-09 16:41:12,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 300 transitions, 1723 flow [2025-01-09 16:41:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:41:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:41:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2025-01-09 16:41:12,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171 [2025-01-09 16:41:12,514 INFO L175 Difference]: Start difference. First operand has 158 places, 292 transitions, 1380 flow. Second operand 3 states and 146 transitions. [2025-01-09 16:41:12,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 300 transitions, 1723 flow [2025-01-09 16:41:12,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 300 transitions, 1709 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-01-09 16:41:12,731 INFO L231 Difference]: Finished difference. Result has 159 places, 274 transitions, 1318 flow [2025-01-09 16:41:12,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1318, PETRI_PLACES=159, PETRI_TRANSITIONS=274} [2025-01-09 16:41:12,732 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 75 predicate places. [2025-01-09 16:41:12,732 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 274 transitions, 1318 flow [2025-01-09 16:41:12,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-01-09 16:41:12,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:12,733 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:12,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:41:12,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 16:41:12,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1718060114, now seen corresponding path program 5 times [2025-01-09 16:41:12,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:12,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631550021] [2025-01-09 16:41:12,734 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:41:12,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:12,741 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 1 equivalence classes. [2025-01-09 16:41:12,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 16:41:12,752 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:41:12,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:13,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631550021] [2025-01-09 16:41:13,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631550021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:13,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:13,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-01-09 16:41:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79751146] [2025-01-09 16:41:13,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:13,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 16:41:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:13,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 16:41:13,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:41:13,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 86 [2025-01-09 16:41:13,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 274 transitions, 1318 flow. Second operand has 22 states, 22 states have (on average 18.5) internal successors, (407), 22 states have internal predecessors, (407), 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-01-09 16:41:13,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:13,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 86 [2025-01-09 16:41:13,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:21,905 INFO L124 PetriNetUnfolderBase]: 62334/83742 cut-off events. [2025-01-09 16:41:21,905 INFO L125 PetriNetUnfolderBase]: For 207310/207310 co-relation queries the response was YES. [2025-01-09 16:41:22,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252906 conditions, 83742 events. 62334/83742 cut-off events. For 207310/207310 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 463185 event pairs, 7556 based on Foata normal form. 1/80421 useless extension candidates. Maximal degree in co-relation 164424. Up to 45689 conditions per place. [2025-01-09 16:41:22,638 INFO L140 encePairwiseOnDemand]: 62/86 looper letters, 866 selfloop transitions, 266 changer transitions 32/1174 dead transitions. [2025-01-09 16:41:22,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1174 transitions, 6780 flow [2025-01-09 16:41:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-09 16:41:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-01-09 16:41:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 2056 transitions. [2025-01-09 16:41:22,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3415282392026578 [2025-01-09 16:41:22,644 INFO L175 Difference]: Start difference. First operand has 159 places, 274 transitions, 1318 flow. Second operand 70 states and 2056 transitions. [2025-01-09 16:41:22,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1174 transitions, 6780 flow [2025-01-09 16:41:23,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1174 transitions, 6740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:23,519 INFO L231 Difference]: Finished difference. Result has 251 places, 525 transitions, 3470 flow [2025-01-09 16:41:23,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=3470, PETRI_PLACES=251, PETRI_TRANSITIONS=525} [2025-01-09 16:41:23,520 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 167 predicate places. [2025-01-09 16:41:23,520 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 525 transitions, 3470 flow [2025-01-09 16:41:23,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 18.5) internal successors, (407), 22 states have internal predecessors, (407), 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-01-09 16:41:23,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:23,520 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:23,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:41:23,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 16:41:23,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash 206728982, now seen corresponding path program 6 times [2025-01-09 16:41:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:23,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112966644] [2025-01-09 16:41:23,521 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:41:23,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:23,527 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 65 statements into 1 equivalence classes. [2025-01-09 16:41:23,533 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 16:41:23,533 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:41:23,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:24,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:24,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112966644] [2025-01-09 16:41:24,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112966644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:24,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:24,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 16:41:24,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135384327] [2025-01-09 16:41:24,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:24,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 16:41:24,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:24,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 16:41:24,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:41:24,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 86 [2025-01-09 16:41:24,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 525 transitions, 3470 flow. Second operand has 21 states, 21 states have (on average 18.61904761904762) internal successors, (391), 21 states have internal predecessors, (391), 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-01-09 16:41:24,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:24,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 86 [2025-01-09 16:41:24,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:38,986 INFO L124 PetriNetUnfolderBase]: 81695/109145 cut-off events. [2025-01-09 16:41:38,986 INFO L125 PetriNetUnfolderBase]: For 428315/428315 co-relation queries the response was YES. [2025-01-09 16:41:39,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383288 conditions, 109145 events. 81695/109145 cut-off events. For 428315/428315 co-relation queries the response was YES. Maximal size of possible extension queue 1651. Compared 622569 event pairs, 10383 based on Foata normal form. 1/104657 useless extension candidates. Maximal degree in co-relation 383201. Up to 58405 conditions per place. [2025-01-09 16:41:40,016 INFO L140 encePairwiseOnDemand]: 63/86 looper letters, 1101 selfloop transitions, 563 changer transitions 17/1691 dead transitions. [2025-01-09 16:41:40,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1691 transitions, 12427 flow [2025-01-09 16:41:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-01-09 16:41:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2025-01-09 16:41:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 3009 transitions. [2025-01-09 16:41:40,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3042467138523761 [2025-01-09 16:41:40,028 INFO L175 Difference]: Start difference. First operand has 251 places, 525 transitions, 3470 flow. Second operand 115 states and 3009 transitions. [2025-01-09 16:41:40,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1691 transitions, 12427 flow [2025-01-09 16:41:45,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 1691 transitions, 11871 flow, removed 278 selfloop flow, removed 1 redundant places. [2025-01-09 16:41:45,168 INFO L231 Difference]: Finished difference. Result has 399 places, 1002 transitions, 8160 flow [2025-01-09 16:41:45,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2992, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=115, PETRI_FLOW=8160, PETRI_PLACES=399, PETRI_TRANSITIONS=1002} [2025-01-09 16:41:45,170 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 315 predicate places. [2025-01-09 16:41:45,171 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 1002 transitions, 8160 flow [2025-01-09 16:41:45,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 18.61904761904762) internal successors, (391), 21 states have internal predecessors, (391), 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-01-09 16:41:45,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:45,172 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:45,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:41:45,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 16:41:45,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2076953574, now seen corresponding path program 7 times [2025-01-09 16:41:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900913076] [2025-01-09 16:41:45,176 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:41:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:45,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 16:41:45,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 16:41:45,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:45,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:45,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900913076] [2025-01-09 16:41:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900913076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:45,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:45,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 16:41:45,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337780247] [2025-01-09 16:41:45,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:45,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 16:41:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:45,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 16:41:45,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:41:45,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 86 [2025-01-09 16:41:45,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 1002 transitions, 8160 flow. Second operand has 21 states, 21 states have (on average 18.61904761904762) internal successors, (391), 21 states have internal predecessors, (391), 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-01-09 16:41:45,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:45,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 86 [2025-01-09 16:41:45,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand