./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:38:06,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:38:06,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:38:06,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:38:06,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:38:06,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:38:06,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:38:06,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:38:06,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:38:06,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:38:06,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:38:06,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:38:06,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:38:06,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:38:06,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:38:06,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:38:06,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:38:06,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:38:06,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:38:06,464 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-03-13 21:38:06,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:38:06,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:38:06,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:38:06,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:38:06,684 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:38:06,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-13 21:38:07,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc28ca1ed/cc1e7219109a40698c7c8388514c4470/FLAG783573705 [2025-03-13 21:38:08,084 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:38:08,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-13 21:38:08,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc28ca1ed/cc1e7219109a40698c7c8388514c4470/FLAG783573705 [2025-03-13 21:38:08,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc28ca1ed/cc1e7219109a40698c7c8388514c4470 [2025-03-13 21:38:08,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:38:08,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:38:08,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:38:08,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:38:08,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:38:08,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a751b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08, skipping insertion in model container [2025-03-13 21:38:08,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:38:08,513 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-03-13 21:38:08,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:38:08,641 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:38:08,648 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-03-13 21:38:08,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:38:08,701 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:38:08,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08 WrapperNode [2025-03-13 21:38:08,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:38:08,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:38:08,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:38:08,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:38:08,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,724 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-03-13 21:38:08,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:38:08,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:38:08,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:38:08,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:38:08,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,738 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-03-13 21:38:08,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:38:08,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:38:08,747 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:38:08,747 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:38:08,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (1/1) ... [2025-03-13 21:38:08,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:38:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:38:08,772 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-13 21:38:08,775 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-13 21:38:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:38:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:38:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-13 21:38:08,788 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-13 21:38:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:38:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:38:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:38:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:38:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:38:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:38:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:38:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:38:08,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:38:08,790 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:38:08,870 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:38:08,871 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:38:09,024 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:38:09,025 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:38:09,025 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:38:09,148 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:38:09,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:38:09 BoogieIcfgContainer [2025-03-13 21:38:09,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:38:09,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:38:09,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:38:09,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:38:09,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:38:08" (1/3) ... [2025-03-13 21:38:09,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c01b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:38:09, skipping insertion in model container [2025-03-13 21:38:09,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:38:08" (2/3) ... [2025-03-13 21:38:09,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c01b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:38:09, skipping insertion in model container [2025-03-13 21:38:09,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:38:09" (3/3) ... [2025-03-13 21:38:09,156 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-13 21:38:09,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:38:09,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-13 21:38:09,167 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:38:09,208 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:38:09,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 78 flow [2025-03-13 21:38:09,250 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-03-13 21:38:09,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:38:09,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 7/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-13 21:38:09,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 78 flow [2025-03-13 21:38:09,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 36 transitions, 75 flow [2025-03-13 21:38:09,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:38:09,274 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;@22186841, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:38:09,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:38:09,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:38:09,281 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-03-13 21:38:09,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:38:09,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:09,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:09,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:09,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1304646758, now seen corresponding path program 1 times [2025-03-13 21:38:09,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:09,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224817692] [2025-03-13 21:38:09,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:38:09,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:09,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:38:09,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:38:09,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:38:09,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:09,685 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-13 21:38:09,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224817692] [2025-03-13 21:38:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224817692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:09,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:09,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:38:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182426126] [2025-03-13 21:38:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:09,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:38:09,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:09,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:38:09,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:38:09,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-13 21:38:09,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-13 21:38:09,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:09,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-13 21:38:09,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:09,944 INFO L124 PetriNetUnfolderBase]: 218/450 cut-off events. [2025-03-13 21:38:09,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:38:09,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 450 events. 218/450 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1930 event pairs, 20 based on Foata normal form. 37/407 useless extension candidates. Maximal degree in co-relation 851. Up to 241 conditions per place. [2025-03-13 21:38:09,952 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 47 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2025-03-13 21:38:09,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 265 flow [2025-03-13 21:38:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:38:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:38:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-03-13 21:38:09,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536036036036036 [2025-03-13 21:38:09,978 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 75 flow. Second operand 6 states and 119 transitions. [2025-03-13 21:38:09,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 265 flow [2025-03-13 21:38:09,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:38:09,989 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 168 flow [2025-03-13 21:38:09,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2025-03-13 21:38:09,994 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-13 21:38:09,994 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 168 flow [2025-03-13 21:38:09,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-13 21:38:09,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:09,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:09,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:38:09,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:09,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1789374339, now seen corresponding path program 1 times [2025-03-13 21:38:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:09,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321100360] [2025-03-13 21:38:09,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:38:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:38:10,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:38:10,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:38:10,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:10,114 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-13 21:38:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321100360] [2025-03-13 21:38:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321100360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:10,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:10,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:38:10,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430551352] [2025-03-13 21:38:10,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:10,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:38:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:10,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:38:10,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:38:10,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-13 21:38:10,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:38:10,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:10,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-13 21:38:10,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:10,300 INFO L124 PetriNetUnfolderBase]: 279/560 cut-off events. [2025-03-13 21:38:10,301 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2025-03-13 21:38:10,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 560 events. 279/560 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2496 event pairs, 55 based on Foata normal form. 20/539 useless extension candidates. Maximal degree in co-relation 1387. Up to 304 conditions per place. [2025-03-13 21:38:10,307 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 58 selfloop transitions, 25 changer transitions 0/89 dead transitions. [2025-03-13 21:38:10,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 89 transitions, 474 flow [2025-03-13 21:38:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:38:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:38:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-13 21:38:10,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-03-13 21:38:10,309 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 168 flow. Second operand 6 states and 108 transitions. [2025-03-13 21:38:10,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 89 transitions, 474 flow [2025-03-13 21:38:10,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:38:10,313 INFO L231 Difference]: Finished difference. Result has 51 places, 60 transitions, 366 flow [2025-03-13 21:38:10,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=51, PETRI_TRANSITIONS=60} [2025-03-13 21:38:10,314 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2025-03-13 21:38:10,314 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 366 flow [2025-03-13 21:38:10,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:38:10,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:10,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:10,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:38:10,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:10,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash -57772208, now seen corresponding path program 1 times [2025-03-13 21:38:10,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-03-13 21:38:10,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:38:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:10,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:38:10,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:38:10,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:38:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:10,582 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-13 21:38:10,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-03-13 21:38:10,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683317562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:10,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:10,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:38:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746850499] [2025-03-13 21:38:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:10,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:38:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:10,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:38:10,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:38:10,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-13 21:38:10,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-13 21:38:10,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:10,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-13 21:38:10,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:10,845 INFO L124 PetriNetUnfolderBase]: 399/859 cut-off events. [2025-03-13 21:38:10,845 INFO L125 PetriNetUnfolderBase]: For 1252/1269 co-relation queries the response was YES. [2025-03-13 21:38:10,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 859 events. 399/859 cut-off events. For 1252/1269 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4770 event pairs, 87 based on Foata normal form. 16/820 useless extension candidates. Maximal degree in co-relation 2722. Up to 360 conditions per place. [2025-03-13 21:38:10,853 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 87 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2025-03-13 21:38:10,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 127 transitions, 942 flow [2025-03-13 21:38:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:38:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:38:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2025-03-13 21:38:10,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6138996138996139 [2025-03-13 21:38:10,857 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 366 flow. Second operand 7 states and 159 transitions. [2025-03-13 21:38:10,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 127 transitions, 942 flow [2025-03-13 21:38:10,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:38:10,868 INFO L231 Difference]: Finished difference. Result has 60 places, 76 transitions, 588 flow [2025-03-13 21:38:10,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=60, PETRI_TRANSITIONS=76} [2025-03-13 21:38:10,869 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2025-03-13 21:38:10,869 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 76 transitions, 588 flow [2025-03-13 21:38:10,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-13 21:38:10,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:10,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:10,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:38:10,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:10,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash -295283684, now seen corresponding path program 2 times [2025-03-13 21:38:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698031015] [2025-03-13 21:38:10,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:38:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:10,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:38:10,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:38:10,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:38:10,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:11,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-13 21:38:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:11,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698031015] [2025-03-13 21:38:11,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698031015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:11,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:11,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:38:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032962766] [2025-03-13 21:38:11,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:38:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:11,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:38:11,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:38:11,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-13 21:38:11,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 76 transitions, 588 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-13 21:38:11,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:11,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-13 21:38:11,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:11,545 INFO L124 PetriNetUnfolderBase]: 485/974 cut-off events. [2025-03-13 21:38:11,545 INFO L125 PetriNetUnfolderBase]: For 2055/2055 co-relation queries the response was YES. [2025-03-13 21:38:11,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 974 events. 485/974 cut-off events. For 2055/2055 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5068 event pairs, 125 based on Foata normal form. 1/975 useless extension candidates. Maximal degree in co-relation 3547. Up to 623 conditions per place. [2025-03-13 21:38:11,552 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 77 selfloop transitions, 67 changer transitions 0/150 dead transitions. [2025-03-13 21:38:11,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 150 transitions, 1398 flow [2025-03-13 21:38:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:38:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:38:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2025-03-13 21:38:11,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39293139293139295 [2025-03-13 21:38:11,554 INFO L175 Difference]: Start difference. First operand has 60 places, 76 transitions, 588 flow. Second operand 13 states and 189 transitions. [2025-03-13 21:38:11,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 150 transitions, 1398 flow [2025-03-13 21:38:11,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 150 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:38:11,564 INFO L231 Difference]: Finished difference. Result has 76 places, 116 transitions, 1098 flow [2025-03-13 21:38:11,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1098, PETRI_PLACES=76, PETRI_TRANSITIONS=116} [2025-03-13 21:38:11,564 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 43 predicate places. [2025-03-13 21:38:11,565 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 116 transitions, 1098 flow [2025-03-13 21:38:11,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-13 21:38:11,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:11,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:11,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:38:11,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:11,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:11,566 INFO L85 PathProgramCache]: Analyzing trace with hash 222292550, now seen corresponding path program 3 times [2025-03-13 21:38:11,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:11,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079222416] [2025-03-13 21:38:11,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:38:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:11,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:38:11,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:38:11,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:38:11,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:11,935 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-13 21:38:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079222416] [2025-03-13 21:38:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079222416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:38:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122822815] [2025-03-13 21:38:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:38:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:11,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:38:11,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:38:11,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-13 21:38:11,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 116 transitions, 1098 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-13 21:38:11,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:11,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-13 21:38:11,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:12,193 INFO L124 PetriNetUnfolderBase]: 468/966 cut-off events. [2025-03-13 21:38:12,193 INFO L125 PetriNetUnfolderBase]: For 2649/2677 co-relation queries the response was YES. [2025-03-13 21:38:12,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3918 conditions, 966 events. 468/966 cut-off events. For 2649/2677 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5146 event pairs, 103 based on Foata normal form. 38/1001 useless extension candidates. Maximal degree in co-relation 3887. Up to 574 conditions per place. [2025-03-13 21:38:12,199 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 73 selfloop transitions, 74 changer transitions 0/158 dead transitions. [2025-03-13 21:38:12,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 158 transitions, 1666 flow [2025-03-13 21:38:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:38:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:38:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2025-03-13 21:38:12,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-03-13 21:38:12,201 INFO L175 Difference]: Start difference. First operand has 76 places, 116 transitions, 1098 flow. Second operand 9 states and 150 transitions. [2025-03-13 21:38:12,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 158 transitions, 1666 flow [2025-03-13 21:38:12,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 158 transitions, 1638 flow, removed 14 selfloop flow, removed 0 redundant places. [2025-03-13 21:38:12,213 INFO L231 Difference]: Finished difference. Result has 88 places, 133 transitions, 1479 flow [2025-03-13 21:38:12,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1479, PETRI_PLACES=88, PETRI_TRANSITIONS=133} [2025-03-13 21:38:12,213 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 55 predicate places. [2025-03-13 21:38:12,213 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 133 transitions, 1479 flow [2025-03-13 21:38:12,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-13 21:38:12,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:12,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:12,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:38:12,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:12,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash -212223524, now seen corresponding path program 4 times [2025-03-13 21:38:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709791324] [2025-03-13 21:38:12,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:38:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:12,225 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-03-13 21:38:12,228 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 14 statements. [2025-03-13 21:38:12,228 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:38:12,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:12,272 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-13 21:38:12,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:12,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709791324] [2025-03-13 21:38:12,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709791324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:12,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:12,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:38:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797517885] [2025-03-13 21:38:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:12,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:38:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:12,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:38:12,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:38:12,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-13 21:38:12,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 133 transitions, 1479 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-13 21:38:12,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:12,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-13 21:38:12,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:12,492 INFO L124 PetriNetUnfolderBase]: 397/888 cut-off events. [2025-03-13 21:38:12,492 INFO L125 PetriNetUnfolderBase]: For 3231/3250 co-relation queries the response was YES. [2025-03-13 21:38:12,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3888 conditions, 888 events. 397/888 cut-off events. For 3231/3250 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5005 event pairs, 5 based on Foata normal form. 42/928 useless extension candidates. Maximal degree in co-relation 3851. Up to 223 conditions per place. [2025-03-13 21:38:12,500 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 143 selfloop transitions, 47 changer transitions 0/214 dead transitions. [2025-03-13 21:38:12,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 214 transitions, 2351 flow [2025-03-13 21:38:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:38:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:38:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-03-13 21:38:12,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2025-03-13 21:38:12,501 INFO L175 Difference]: Start difference. First operand has 88 places, 133 transitions, 1479 flow. Second operand 6 states and 146 transitions. [2025-03-13 21:38:12,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 214 transitions, 2351 flow [2025-03-13 21:38:12,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 214 transitions, 2207 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-03-13 21:38:12,517 INFO L231 Difference]: Finished difference. Result has 92 places, 147 transitions, 1532 flow [2025-03-13 21:38:12,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1532, PETRI_PLACES=92, PETRI_TRANSITIONS=147} [2025-03-13 21:38:12,518 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 59 predicate places. [2025-03-13 21:38:12,519 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 147 transitions, 1532 flow [2025-03-13 21:38:12,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-13 21:38:12,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:12,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:12,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:38:12,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:12,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash 274067710, now seen corresponding path program 5 times [2025-03-13 21:38:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:12,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-03-13 21:38:12,520 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:38:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:12,528 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:38:12,532 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:38:12,532 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:38:12,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:12,673 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-13 21:38:12,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-03-13 21:38:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63390728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:12,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:38:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932029002] [2025-03-13 21:38:12,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:12,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:38:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:12,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:38:12,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:38:12,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-13 21:38:12,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 147 transitions, 1532 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-13 21:38:12,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:12,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-13 21:38:12,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:12,974 INFO L124 PetriNetUnfolderBase]: 629/1400 cut-off events. [2025-03-13 21:38:12,974 INFO L125 PetriNetUnfolderBase]: For 5859/5874 co-relation queries the response was YES. [2025-03-13 21:38:12,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6699 conditions, 1400 events. 629/1400 cut-off events. For 5859/5874 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8689 event pairs, 189 based on Foata normal form. 19/1411 useless extension candidates. Maximal degree in co-relation 6659. Up to 658 conditions per place. [2025-03-13 21:38:12,985 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 151 selfloop transitions, 52 changer transitions 0/222 dead transitions. [2025-03-13 21:38:12,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 222 transitions, 2536 flow [2025-03-13 21:38:12,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:38:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:38:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-03-13 21:38:12,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640926640926641 [2025-03-13 21:38:12,986 INFO L175 Difference]: Start difference. First operand has 92 places, 147 transitions, 1532 flow. Second operand 7 states and 166 transitions. [2025-03-13 21:38:12,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 222 transitions, 2536 flow [2025-03-13 21:38:13,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 222 transitions, 2463 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-13 21:38:13,024 INFO L231 Difference]: Finished difference. Result has 98 places, 159 transitions, 1791 flow [2025-03-13 21:38:13,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1791, PETRI_PLACES=98, PETRI_TRANSITIONS=159} [2025-03-13 21:38:13,025 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 65 predicate places. [2025-03-13 21:38:13,025 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 159 transitions, 1791 flow [2025-03-13 21:38:13,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-13 21:38:13,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:13,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:13,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:38:13,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:13,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1762842032, now seen corresponding path program 6 times [2025-03-13 21:38:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:13,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205411651] [2025-03-13 21:38:13,026 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:38:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:13,033 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:38:13,036 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:38:13,037 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:38:13,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:13,158 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-13 21:38:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205411651] [2025-03-13 21:38:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205411651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:38:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286551785] [2025-03-13 21:38:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:38:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:13,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:38:13,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:38:13,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-13 21:38:13,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 159 transitions, 1791 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-13 21:38:13,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:13,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-13 21:38:13,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:13,533 INFO L124 PetriNetUnfolderBase]: 833/1844 cut-off events. [2025-03-13 21:38:13,533 INFO L125 PetriNetUnfolderBase]: For 9392/9411 co-relation queries the response was YES. [2025-03-13 21:38:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9102 conditions, 1844 events. 833/1844 cut-off events. For 9392/9411 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11107 event pairs, 231 based on Foata normal form. 23/1860 useless extension candidates. Maximal degree in co-relation 9060. Up to 568 conditions per place. [2025-03-13 21:38:13,545 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 186 selfloop transitions, 53 changer transitions 0/258 dead transitions. [2025-03-13 21:38:13,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 258 transitions, 3037 flow [2025-03-13 21:38:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:38:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:38:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-03-13 21:38:13,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-03-13 21:38:13,546 INFO L175 Difference]: Start difference. First operand has 98 places, 159 transitions, 1791 flow. Second operand 7 states and 168 transitions. [2025-03-13 21:38:13,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 258 transitions, 3037 flow [2025-03-13 21:38:13,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 258 transitions, 2984 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-13 21:38:13,572 INFO L231 Difference]: Finished difference. Result has 105 places, 171 transitions, 2064 flow [2025-03-13 21:38:13,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2064, PETRI_PLACES=105, PETRI_TRANSITIONS=171} [2025-03-13 21:38:13,573 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 72 predicate places. [2025-03-13 21:38:13,573 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 171 transitions, 2064 flow [2025-03-13 21:38:13,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-13 21:38:13,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:13,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:13,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:38:13,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:13,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:13,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1657041066, now seen corresponding path program 7 times [2025-03-13 21:38:13,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:13,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773717899] [2025-03-13 21:38:13,574 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:38:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:13,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:38:13,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:38:13,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:38:13,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:13,795 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-13 21:38:13,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:13,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773717899] [2025-03-13 21:38:13,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773717899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:13,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:13,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:38:13,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484989305] [2025-03-13 21:38:13,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:13,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:38:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:13,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:38:13,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:38:13,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-13 21:38:13,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 171 transitions, 2064 flow. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 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-13 21:38:13,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:13,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-13 21:38:13,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:14,241 INFO L124 PetriNetUnfolderBase]: 830/1741 cut-off events. [2025-03-13 21:38:14,241 INFO L125 PetriNetUnfolderBase]: For 9141/9151 co-relation queries the response was YES. [2025-03-13 21:38:14,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8692 conditions, 1741 events. 830/1741 cut-off events. For 9141/9151 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 9714 event pairs, 298 based on Foata normal form. 7/1747 useless extension candidates. Maximal degree in co-relation 8647. Up to 1312 conditions per place. [2025-03-13 21:38:14,255 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 119 selfloop transitions, 39 changer transitions 6/170 dead transitions. [2025-03-13 21:38:14,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 170 transitions, 2057 flow [2025-03-13 21:38:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:38:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:38:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 180 transitions. [2025-03-13 21:38:14,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37422037422037424 [2025-03-13 21:38:14,256 INFO L175 Difference]: Start difference. First operand has 105 places, 171 transitions, 2064 flow. Second operand 13 states and 180 transitions. [2025-03-13 21:38:14,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 170 transitions, 2057 flow [2025-03-13 21:38:14,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 170 transitions, 1898 flow, removed 49 selfloop flow, removed 7 redundant places. [2025-03-13 21:38:14,281 INFO L231 Difference]: Finished difference. Result has 113 places, 140 transitions, 1460 flow [2025-03-13 21:38:14,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1460, PETRI_PLACES=113, PETRI_TRANSITIONS=140} [2025-03-13 21:38:14,283 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 80 predicate places. [2025-03-13 21:38:14,283 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 140 transitions, 1460 flow [2025-03-13 21:38:14,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 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-13 21:38:14,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:14,283 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:14,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:38:14,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:14,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:14,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1321450124, now seen corresponding path program 1 times [2025-03-13 21:38:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:14,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796527898] [2025-03-13 21:38:14,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:38:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:14,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:38:14,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:38:14,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:38:14,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:14,541 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-13 21:38:14,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:14,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796527898] [2025-03-13 21:38:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796527898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:14,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:14,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:38:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033140337] [2025-03-13 21:38:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:14,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:38:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:14,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:38:14,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:38:14,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-13 21:38:14,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 140 transitions, 1460 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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-13 21:38:14,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:14,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-13 21:38:14,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:15,217 INFO L124 PetriNetUnfolderBase]: 1615/3333 cut-off events. [2025-03-13 21:38:15,218 INFO L125 PetriNetUnfolderBase]: For 17071/17216 co-relation queries the response was YES. [2025-03-13 21:38:15,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16431 conditions, 3333 events. 1615/3333 cut-off events. For 17071/17216 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 20716 event pairs, 357 based on Foata normal form. 196/3501 useless extension candidates. Maximal degree in co-relation 16386. Up to 1351 conditions per place. [2025-03-13 21:38:15,243 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 242 selfloop transitions, 156 changer transitions 0/410 dead transitions. [2025-03-13 21:38:15,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 410 transitions, 4685 flow [2025-03-13 21:38:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:38:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:38:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 302 transitions. [2025-03-13 21:38:15,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5441441441441441 [2025-03-13 21:38:15,246 INFO L175 Difference]: Start difference. First operand has 113 places, 140 transitions, 1460 flow. Second operand 15 states and 302 transitions. [2025-03-13 21:38:15,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 410 transitions, 4685 flow [2025-03-13 21:38:15,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 410 transitions, 4482 flow, removed 14 selfloop flow, removed 12 redundant places. [2025-03-13 21:38:15,283 INFO L231 Difference]: Finished difference. Result has 127 places, 275 transitions, 3462 flow [2025-03-13 21:38:15,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3462, PETRI_PLACES=127, PETRI_TRANSITIONS=275} [2025-03-13 21:38:15,284 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 94 predicate places. [2025-03-13 21:38:15,284 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 275 transitions, 3462 flow [2025-03-13 21:38:15,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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-13 21:38:15,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:15,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:15,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:38:15,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:15,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash -890936668, now seen corresponding path program 2 times [2025-03-13 21:38:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:15,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-03-13 21:38:15,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:38:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:15,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:38:15,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-03-13 21:38:15,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:38:15,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:38:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-03-13 21:38:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951240409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:38:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149098815] [2025-03-13 21:38:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:15,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:38:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:15,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:38:15,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:38:15,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-13 21:38:15,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 275 transitions, 3462 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-13 21:38:15,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:15,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-13 21:38:15,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:16,203 INFO L124 PetriNetUnfolderBase]: 2080/4229 cut-off events. [2025-03-13 21:38:16,203 INFO L125 PetriNetUnfolderBase]: For 35910/35942 co-relation queries the response was YES. [2025-03-13 21:38:16,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24709 conditions, 4229 events. 2080/4229 cut-off events. For 35910/35942 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 27185 event pairs, 274 based on Foata normal form. 46/4269 useless extension candidates. Maximal degree in co-relation 24653. Up to 1427 conditions per place. [2025-03-13 21:38:16,228 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 300 selfloop transitions, 253 changer transitions 0/559 dead transitions. [2025-03-13 21:38:16,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 559 transitions, 7892 flow [2025-03-13 21:38:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:38:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:38:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 222 transitions. [2025-03-13 21:38:16,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-13 21:38:16,230 INFO L175 Difference]: Start difference. First operand has 127 places, 275 transitions, 3462 flow. Second operand 14 states and 222 transitions. [2025-03-13 21:38:16,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 559 transitions, 7892 flow [2025-03-13 21:38:16,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 559 transitions, 7776 flow, removed 58 selfloop flow, removed 1 redundant places. [2025-03-13 21:38:16,348 INFO L231 Difference]: Finished difference. Result has 151 places, 453 transitions, 6893 flow [2025-03-13 21:38:16,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3410, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6893, PETRI_PLACES=151, PETRI_TRANSITIONS=453} [2025-03-13 21:38:16,349 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 118 predicate places. [2025-03-13 21:38:16,349 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 453 transitions, 6893 flow [2025-03-13 21:38:16,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-13 21:38:16,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:16,349 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:16,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:38:16,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:16,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1681171624, now seen corresponding path program 3 times [2025-03-13 21:38:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:16,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022784773] [2025-03-13 21:38:16,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:38:16,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:16,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:38:16,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-03-13 21:38:16,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:38:16,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:38:16,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:16,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022784773] [2025-03-13 21:38:16,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022784773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:16,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:16,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:38:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081161708] [2025-03-13 21:38:16,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:16,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:38:16,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:16,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:38:16,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:38:16,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-13 21:38:16,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 453 transitions, 6893 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-13 21:38:16,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:16,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-13 21:38:16,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:17,498 INFO L124 PetriNetUnfolderBase]: 2180/4441 cut-off events. [2025-03-13 21:38:17,498 INFO L125 PetriNetUnfolderBase]: For 54716/54720 co-relation queries the response was YES. [2025-03-13 21:38:17,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29847 conditions, 4441 events. 2180/4441 cut-off events. For 54716/54720 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 28623 event pairs, 121 based on Foata normal form. 24/4465 useless extension candidates. Maximal degree in co-relation 29780. Up to 1021 conditions per place. [2025-03-13 21:38:17,528 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 242 selfloop transitions, 417 changer transitions 0/665 dead transitions. [2025-03-13 21:38:17,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 665 transitions, 10857 flow [2025-03-13 21:38:17,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 21:38:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 21:38:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 262 transitions. [2025-03-13 21:38:17,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4165341812400636 [2025-03-13 21:38:17,530 INFO L175 Difference]: Start difference. First operand has 151 places, 453 transitions, 6893 flow. Second operand 17 states and 262 transitions. [2025-03-13 21:38:17,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 665 transitions, 10857 flow [2025-03-13 21:38:17,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 665 transitions, 10561 flow, removed 148 selfloop flow, removed 0 redundant places. [2025-03-13 21:38:17,740 INFO L231 Difference]: Finished difference. Result has 177 places, 585 transitions, 10103 flow [2025-03-13 21:38:17,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6649, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10103, PETRI_PLACES=177, PETRI_TRANSITIONS=585} [2025-03-13 21:38:17,741 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 144 predicate places. [2025-03-13 21:38:17,741 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 585 transitions, 10103 flow [2025-03-13 21:38:17,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-13 21:38:17,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:17,741 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:17,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:38:17,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:17,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1082596876, now seen corresponding path program 4 times [2025-03-13 21:38:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:17,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459685826] [2025-03-13 21:38:17,743 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:38:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:17,753 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-13 21:38:17,756 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 20 statements. [2025-03-13 21:38:17,757 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:38:17,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:17,809 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-13 21:38:17,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:17,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459685826] [2025-03-13 21:38:17,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459685826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:17,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:17,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:38:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881370215] [2025-03-13 21:38:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:38:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:17,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:38:17,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:38:17,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-13 21:38:17,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 585 transitions, 10103 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-13 21:38:17,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:17,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-13 21:38:17,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:18,631 INFO L124 PetriNetUnfolderBase]: 2047/4353 cut-off events. [2025-03-13 21:38:18,631 INFO L125 PetriNetUnfolderBase]: For 64379/64517 co-relation queries the response was YES. [2025-03-13 21:38:18,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31727 conditions, 4353 events. 2047/4353 cut-off events. For 64379/64517 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29738 event pairs, 206 based on Foata normal form. 94/4406 useless extension candidates. Maximal degree in co-relation 31650. Up to 1522 conditions per place. [2025-03-13 21:38:18,671 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 519 selfloop transitions, 148 changer transitions 0/743 dead transitions. [2025-03-13 21:38:18,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 743 transitions, 13926 flow [2025-03-13 21:38:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:38:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:38:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-13 21:38:18,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-13 21:38:18,676 INFO L175 Difference]: Start difference. First operand has 177 places, 585 transitions, 10103 flow. Second operand 5 states and 110 transitions. [2025-03-13 21:38:18,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 743 transitions, 13926 flow [2025-03-13 21:38:19,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 743 transitions, 13590 flow, removed 148 selfloop flow, removed 2 redundant places. [2025-03-13 21:38:19,053 INFO L231 Difference]: Finished difference. Result has 181 places, 595 transitions, 10301 flow [2025-03-13 21:38:19,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9869, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10301, PETRI_PLACES=181, PETRI_TRANSITIONS=595} [2025-03-13 21:38:19,054 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 148 predicate places. [2025-03-13 21:38:19,054 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 595 transitions, 10301 flow [2025-03-13 21:38:19,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-13 21:38:19,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:19,054 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:19,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:38:19,054 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:19,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1947080749, now seen corresponding path program 1 times [2025-03-13 21:38:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:19,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828005834] [2025-03-13 21:38:19,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:38:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:19,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:38:19,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:38:19,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:38:19,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:38:19,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828005834] [2025-03-13 21:38:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828005834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:38:19,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:38:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453499300] [2025-03-13 21:38:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:19,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:38:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:19,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:38:19,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:38:19,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-13 21:38:19,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 595 transitions, 10301 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:38:19,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:19,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-13 21:38:19,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:19,995 INFO L124 PetriNetUnfolderBase]: 2062/4330 cut-off events. [2025-03-13 21:38:19,995 INFO L125 PetriNetUnfolderBase]: For 63161/63252 co-relation queries the response was YES. [2025-03-13 21:38:20,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32728 conditions, 4330 events. 2062/4330 cut-off events. For 63161/63252 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 29084 event pairs, 428 based on Foata normal form. 13/4310 useless extension candidates. Maximal degree in co-relation 32649. Up to 3697 conditions per place. [2025-03-13 21:38:20,040 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 492 selfloop transitions, 8 changer transitions 23/581 dead transitions. [2025-03-13 21:38:20,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 581 transitions, 10973 flow [2025-03-13 21:38:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:38:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:38:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-13 21:38:20,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-03-13 21:38:20,042 INFO L175 Difference]: Start difference. First operand has 181 places, 595 transitions, 10301 flow. Second operand 5 states and 95 transitions. [2025-03-13 21:38:20,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 581 transitions, 10973 flow [2025-03-13 21:38:20,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 581 transitions, 10688 flow, removed 77 selfloop flow, removed 2 redundant places. [2025-03-13 21:38:20,420 INFO L231 Difference]: Finished difference. Result has 185 places, 557 transitions, 9296 flow [2025-03-13 21:38:20,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9599, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9296, PETRI_PLACES=185, PETRI_TRANSITIONS=557} [2025-03-13 21:38:20,421 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 152 predicate places. [2025-03-13 21:38:20,421 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 557 transitions, 9296 flow [2025-03-13 21:38:20,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:38:20,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:20,422 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:20,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:38:20,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:20,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash -924902277, now seen corresponding path program 5 times [2025-03-13 21:38:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:20,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105338790] [2025-03-13 21:38:20,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:38:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:20,435 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:38:20,442 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:38:20,442 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:38:20,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:38:20,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105338790] [2025-03-13 21:38:20,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105338790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:38:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256822199] [2025-03-13 21:38:20,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:38:20,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:38:20,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:38:20,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:38:20,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:38:20,919 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:38:20,938 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:38:20,938 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:38:20,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:20,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-13 21:38:20,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:38:21,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-13 21:38:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 21:38:21,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:38:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256822199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:38:21,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:38:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-03-13 21:38:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98134421] [2025-03-13 21:38:21,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:38:21,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:38:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:21,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:38:21,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:38:21,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-13 21:38:21,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 557 transitions, 9296 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-13 21:38:21,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:21,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-13 21:38:21,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:21,524 INFO L124 PetriNetUnfolderBase]: 668/1613 cut-off events. [2025-03-13 21:38:21,524 INFO L125 PetriNetUnfolderBase]: For 25016/25067 co-relation queries the response was YES. [2025-03-13 21:38:21,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12302 conditions, 1613 events. 668/1613 cut-off events. For 25016/25067 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9341 event pairs, 90 based on Foata normal form. 38/1628 useless extension candidates. Maximal degree in co-relation 12220. Up to 461 conditions per place. [2025-03-13 21:38:21,535 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 245 selfloop transitions, 136 changer transitions 0/425 dead transitions. [2025-03-13 21:38:21,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 425 transitions, 8158 flow [2025-03-13 21:38:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:38:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:38:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2025-03-13 21:38:21,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2025-03-13 21:38:21,536 INFO L175 Difference]: Start difference. First operand has 185 places, 557 transitions, 9296 flow. Second operand 8 states and 170 transitions. [2025-03-13 21:38:21,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 425 transitions, 8158 flow [2025-03-13 21:38:21,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 425 transitions, 6359 flow, removed 111 selfloop flow, removed 48 redundant places. [2025-03-13 21:38:21,614 INFO L231 Difference]: Finished difference. Result has 137 places, 381 transitions, 5484 flow [2025-03-13 21:38:21,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4527, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5484, PETRI_PLACES=137, PETRI_TRANSITIONS=381} [2025-03-13 21:38:21,614 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 104 predicate places. [2025-03-13 21:38:21,615 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 381 transitions, 5484 flow [2025-03-13 21:38:21,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-13 21:38:21,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:38:21,615 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:38:21,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:38:21,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 21:38:21,815 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:38:21,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:38:21,816 INFO L85 PathProgramCache]: Analyzing trace with hash -935373530, now seen corresponding path program 1 times [2025-03-13 21:38:21,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:38:21,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682454154] [2025-03-13 21:38:21,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:38:21,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:38:21,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:38:21,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:38:21,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:38:21,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:38:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:38:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682454154] [2025-03-13 21:38:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682454154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:38:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355264695] [2025-03-13 21:38:21,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:38:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:38:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:38:21,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:38:21,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:38:22,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:38:22,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:38:22,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:38:22,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:38:22,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-13 21:38:22,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:38:22,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 21:38:22,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-13 21:38:22,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-13 21:38:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:38:22,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:38:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:38:22,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355264695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:38:22,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:38:22,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 26 [2025-03-13 21:38:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279901324] [2025-03-13 21:38:22,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:38:22,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-13 21:38:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:38:22,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-13 21:38:22,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-03-13 21:38:22,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-13 21:38:22,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 381 transitions, 5484 flow. Second operand has 26 states, 26 states have (on average 9.307692307692308) internal successors, (242), 26 states have internal predecessors, (242), 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-13 21:38:22,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:38:22,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-13 21:38:22,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:38:23,431 INFO L124 PetriNetUnfolderBase]: 867/2014 cut-off events. [2025-03-13 21:38:23,432 INFO L125 PetriNetUnfolderBase]: For 19076/19115 co-relation queries the response was YES. [2025-03-13 21:38:23,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13059 conditions, 2014 events. 867/2014 cut-off events. For 19076/19115 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11945 event pairs, 54 based on Foata normal form. 50/2064 useless extension candidates. Maximal degree in co-relation 13004. Up to 584 conditions per place. [2025-03-13 21:38:23,442 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 0 selfloop transitions, 0 changer transitions 560/560 dead transitions. [2025-03-13 21:38:23,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 560 transitions, 9007 flow [2025-03-13 21:38:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:38:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:38:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 273 transitions. [2025-03-13 21:38:23,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-03-13 21:38:23,443 INFO L175 Difference]: Start difference. First operand has 137 places, 381 transitions, 5484 flow. Second operand 21 states and 273 transitions. [2025-03-13 21:38:23,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 560 transitions, 9007 flow [2025-03-13 21:38:23,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 560 transitions, 8732 flow, removed 77 selfloop flow, removed 4 redundant places. [2025-03-13 21:38:23,499 INFO L231 Difference]: Finished difference. Result has 151 places, 0 transitions, 0 flow [2025-03-13 21:38:23,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5314, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=0, PETRI_PLACES=151, PETRI_TRANSITIONS=0} [2025-03-13 21:38:23,500 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 118 predicate places. [2025-03-13 21:38:23,500 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 0 transitions, 0 flow [2025-03-13 21:38:23,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.307692307692308) internal successors, (242), 26 states have internal predecessors, (242), 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-13 21:38:23,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 21:38:23,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-13 21:38:23,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-13 21:38:23,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-13 21:38:23,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-13 21:38:23,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:38:23,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 21:38:23,703 INFO L422 BasicCegarLoop]: Path program histogram: [7, 5, 1, 1, 1, 1] [2025-03-13 21:38:23,707 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:38:23,707 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:38:23,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:38:23 BasicIcfg [2025-03-13 21:38:23,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:38:23,710 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:38:23,710 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:38:23,710 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:38:23,711 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:38:09" (3/4) ... [2025-03-13 21:38:23,712 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:38:23,713 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure worker [2025-03-13 21:38:23,715 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2025-03-13 21:38:23,715 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-13 21:38:23,715 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-13 21:38:23,715 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:38:23,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:38:23,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:38:23,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:38:23,772 INFO L158 Benchmark]: Toolchain (without parser) took 15409.45ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 105.7MB in the beginning and 558.9MB in the end (delta: -453.2MB). Peak memory consumption was 277.3MB. Max. memory is 16.1GB. [2025-03-13 21:38:23,772 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:38:23,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.73ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 85.8MB in the end (delta: 19.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:38:23,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.75ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 83.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:38:23,773 INFO L158 Benchmark]: Boogie Preprocessor took 20.76ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:38:23,773 INFO L158 Benchmark]: IcfgBuilder took 402.12ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 38.6MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 21:38:23,773 INFO L158 Benchmark]: TraceAbstraction took 14559.62ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 37.9MB in the beginning and 563.2MB in the end (delta: -525.2MB). Peak memory consumption was 210.2MB. Max. memory is 16.1GB. [2025-03-13 21:38:23,773 INFO L158 Benchmark]: Witness Printer took 60.79ms. Allocated memory is still 872.4MB. Free memory was 563.2MB in the beginning and 558.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:38:23,774 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.19ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.73ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 85.8MB in the end (delta: 19.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.75ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 83.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.76ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 402.12ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 38.6MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14559.62ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 37.9MB in the beginning and 563.2MB in the end (delta: -525.2MB). Peak memory consumption was 210.2MB. Max. memory is 16.1GB. * Witness Printer took 60.79ms. Allocated memory is still 872.4MB. Free memory was 563.2MB in the beginning and 558.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 3 procedures, 54 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: 14.5s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1194 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1156 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4408 IncrementalHoareTripleChecker+Invalid, 4507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 53 mSDtfsCounter, 4408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10301occurred in iteration=13, InterpolantAutomatonStates: 159, 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.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 325 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 3141 SizeOfPredicates, 32 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 15/32 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-13 21:38:23,792 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