./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/weaver/parallel-min-max-1.wvr.c -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 bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:03:39,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:03:39,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:03:39,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:03:39,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:03:39,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:03:39,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:03:39,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:03:39,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:03:39,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:03:39,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:03:39,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:03:39,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:03:39,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:03:39,340 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:03:39,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:03:39,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:03:39,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:03:39,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:03:39,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:03:39,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:03:39,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:03:39,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:03:39,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:03:39,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:03:39,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:03:39,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:03:39,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:03:39,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:03:39,342 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 -> bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 [2025-03-14 01:03:39,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:03:39,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:03:39,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:03:39,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:03:39,577 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:03:39,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-03-14 01:03:40,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc73ec21/7fc61cf223c34c2a91837a4a45842d9e/FLAG326553f87 [2025-03-14 01:03:41,033 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:03:41,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-03-14 01:03:41,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc73ec21/7fc61cf223c34c2a91837a4a45842d9e/FLAG326553f87 [2025-03-14 01:03:41,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc73ec21/7fc61cf223c34c2a91837a4a45842d9e [2025-03-14 01:03:41,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:03:41,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:03:41,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:03:41,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:03:41,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:03:41,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da30404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41, skipping insertion in model container [2025-03-14 01:03:41,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:03:41,477 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/weaver/parallel-min-max-1.wvr.c[2642,2655] [2025-03-14 01:03:41,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:03:41,495 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:03:41,514 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/weaver/parallel-min-max-1.wvr.c[2642,2655] [2025-03-14 01:03:41,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:03:41,532 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:03:41,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41 WrapperNode [2025-03-14 01:03:41,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:03:41,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:03:41,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:03:41,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:03:41,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,563 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-03-14 01:03:41,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:03:41,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:03:41,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:03:41,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:03:41,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,591 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-14 01:03:41,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,602 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:03:41,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:03:41,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:03:41,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:03:41,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (1/1) ... [2025-03-14 01:03:41,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:03:41,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:03:41,643 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-14 01:03:41,650 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-14 01:03:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:03:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:03:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:03:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:03:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:03:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:03:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:03:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:03:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:03:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:03:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:03:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:03:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:03:41,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:03:41,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:03:41,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:03:41,671 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:03:41,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:03:41,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:03:42,045 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:03:42,046 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:03:42,046 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:03:42,209 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:03:42,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:03:42 BoogieIcfgContainer [2025-03-14 01:03:42,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:03:42,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:03:42,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:03:42,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:03:42,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:03:41" (1/3) ... [2025-03-14 01:03:42,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76de049a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:03:42, skipping insertion in model container [2025-03-14 01:03:42,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:03:41" (2/3) ... [2025-03-14 01:03:42,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76de049a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:03:42, skipping insertion in model container [2025-03-14 01:03:42,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:03:42" (3/3) ... [2025-03-14 01:03:42,216 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-03-14 01:03:42,226 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:03:42,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 51 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-14 01:03:42,228 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:03:42,283 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:03:42,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 131 flow [2025-03-14 01:03:42,346 INFO L124 PetriNetUnfolderBase]: 5/52 cut-off events. [2025-03-14 01:03:42,347 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:03:42,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 5/52 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-14 01:03:42,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 55 transitions, 131 flow [2025-03-14 01:03:42,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 120 flow [2025-03-14 01:03:42,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:03:42,381 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;@3da3f04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:03:42,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:03:42,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:03:42,417 INFO L124 PetriNetUnfolderBase]: 5/50 cut-off events. [2025-03-14 01:03:42,417 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:03:42,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:42,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:42,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:42,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash 475076644, now seen corresponding path program 1 times [2025-03-14 01:03:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:42,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503496176] [2025-03-14 01:03:42,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:03:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:42,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:03:42,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:03:42,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:03:42,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:42,769 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-14 01:03:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:42,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503496176] [2025-03-14 01:03:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503496176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:03:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334140648] [2025-03-14 01:03:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:42,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:03:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:42,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:03:42,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:03:42,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-03-14 01:03:42,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:03:42,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:42,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-03-14 01:03:42,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:43,295 INFO L124 PetriNetUnfolderBase]: 2431/3483 cut-off events. [2025-03-14 01:03:43,295 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-03-14 01:03:43,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7223 conditions, 3483 events. 2431/3483 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16071 event pairs, 1290 based on Foata normal form. 0/2908 useless extension candidates. Maximal degree in co-relation 6906. Up to 2363 conditions per place. [2025-03-14 01:03:43,323 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 63 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-14 01:03:43,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 298 flow [2025-03-14 01:03:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:03:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:03:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-14 01:03:43,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-14 01:03:43,337 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 120 flow. Second operand 4 states and 99 transitions. [2025-03-14 01:03:43,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 298 flow [2025-03-14 01:03:43,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 282 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:03:43,346 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 122 flow [2025-03-14 01:03:43,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2025-03-14 01:03:43,352 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-03-14 01:03:43,352 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 122 flow [2025-03-14 01:03:43,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:03:43,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:43,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:43,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:03:43,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:43,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1792304544, now seen corresponding path program 1 times [2025-03-14 01:03:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:43,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216845287] [2025-03-14 01:03:43,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:03:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:43,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:03:43,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:03:43,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:03:43,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:03:43,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:43,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216845287] [2025-03-14 01:03:43,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216845287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:43,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:43,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:03:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105660501] [2025-03-14 01:03:43,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:43,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:03:43,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:43,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:03:43,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:03:43,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-03-14 01:03:43,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-14 01:03:43,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:43,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-03-14 01:03:43,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:43,869 INFO L124 PetriNetUnfolderBase]: 3152/4521 cut-off events. [2025-03-14 01:03:43,869 INFO L125 PetriNetUnfolderBase]: For 192/285 co-relation queries the response was YES. [2025-03-14 01:03:43,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 4521 events. 3152/4521 cut-off events. For 192/285 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 21338 event pairs, 1744 based on Foata normal form. 93/4075 useless extension candidates. Maximal degree in co-relation 2816. Up to 3097 conditions per place. [2025-03-14 01:03:43,888 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 66 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-14 01:03:43,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 313 flow [2025-03-14 01:03:43,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:03:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:03:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-03-14 01:03:43,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-14 01:03:43,890 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 122 flow. Second operand 4 states and 100 transitions. [2025-03-14 01:03:43,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 313 flow [2025-03-14 01:03:43,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:03:43,892 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 132 flow [2025-03-14 01:03:43,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2025-03-14 01:03:43,893 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-03-14 01:03:43,893 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 132 flow [2025-03-14 01:03:43,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-14 01:03:43,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:43,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:43,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:03:43,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:43,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1799488025, now seen corresponding path program 1 times [2025-03-14 01:03:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:43,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078248483] [2025-03-14 01:03:43,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:03:43,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:43,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:03:43,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:03:43,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:03:43,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:03:44,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078248483] [2025-03-14 01:03:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078248483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:44,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:44,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:03:44,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378280961] [2025-03-14 01:03:44,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:44,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:03:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:44,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:03:44,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:03:44,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2025-03-14 01:03:44,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:03:44,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:44,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2025-03-14 01:03:44,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:44,381 INFO L124 PetriNetUnfolderBase]: 2930/4214 cut-off events. [2025-03-14 01:03:44,381 INFO L125 PetriNetUnfolderBase]: For 203/380 co-relation queries the response was YES. [2025-03-14 01:03:44,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9241 conditions, 4214 events. 2930/4214 cut-off events. For 203/380 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19405 event pairs, 2338 based on Foata normal form. 177/3957 useless extension candidates. Maximal degree in co-relation 2769. Up to 4155 conditions per place. [2025-03-14 01:03:44,395 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 45 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-03-14 01:03:44,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 230 flow [2025-03-14 01:03:44,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:03:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:03:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-14 01:03:44,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37727272727272726 [2025-03-14 01:03:44,397 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 132 flow. Second operand 4 states and 83 transitions. [2025-03-14 01:03:44,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 230 flow [2025-03-14 01:03:44,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:03:44,399 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 142 flow [2025-03-14 01:03:44,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2025-03-14 01:03:44,399 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-03-14 01:03:44,399 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 142 flow [2025-03-14 01:03:44,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:03:44,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:44,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:44,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:03:44,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:44,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2142059743, now seen corresponding path program 1 times [2025-03-14 01:03:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:44,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017962505] [2025-03-14 01:03:44,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:03:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:44,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:03:44,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:03:44,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:03:44,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:03:44,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:44,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017962505] [2025-03-14 01:03:44,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017962505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:44,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:44,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:03:44,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802574895] [2025-03-14 01:03:44,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:44,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:03:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:44,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:03:44,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:03:44,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-03-14 01:03:44,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 142 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-14 01:03:44,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:44,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-03-14 01:03:44,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:45,750 INFO L124 PetriNetUnfolderBase]: 8081/11542 cut-off events. [2025-03-14 01:03:45,751 INFO L125 PetriNetUnfolderBase]: For 1316/1645 co-relation queries the response was YES. [2025-03-14 01:03:45,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25478 conditions, 11542 events. 8081/11542 cut-off events. For 1316/1645 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 60339 event pairs, 1244 based on Foata normal form. 332/10822 useless extension candidates. Maximal degree in co-relation 25440. Up to 2512 conditions per place. [2025-03-14 01:03:45,791 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 129 selfloop transitions, 18 changer transitions 116/267 dead transitions. [2025-03-14 01:03:45,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 267 transitions, 1214 flow [2025-03-14 01:03:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 01:03:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 01:03:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 359 transitions. [2025-03-14 01:03:45,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40795454545454546 [2025-03-14 01:03:45,796 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 142 flow. Second operand 16 states and 359 transitions. [2025-03-14 01:03:45,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 267 transitions, 1214 flow [2025-03-14 01:03:45,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 267 transitions, 1208 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 01:03:45,802 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 247 flow [2025-03-14 01:03:45,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=247, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2025-03-14 01:03:45,803 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2025-03-14 01:03:45,803 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 247 flow [2025-03-14 01:03:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-14 01:03:45,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:45,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:45,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:03:45,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:45,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash -402584309, now seen corresponding path program 1 times [2025-03-14 01:03:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137737587] [2025-03-14 01:03:45,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:03:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:45,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-14 01:03:45,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 01:03:45,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:03:45,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:03:46,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137737587] [2025-03-14 01:03:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137737587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:46,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:46,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:03:46,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929097988] [2025-03-14 01:03:46,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:46,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:03:46,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:46,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:03:46,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:03:46,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-03-14 01:03:46,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 247 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-14 01:03:46,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:46,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-03-14 01:03:46,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:47,715 INFO L124 PetriNetUnfolderBase]: 8534/12303 cut-off events. [2025-03-14 01:03:47,715 INFO L125 PetriNetUnfolderBase]: For 11036/11215 co-relation queries the response was YES. [2025-03-14 01:03:47,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33246 conditions, 12303 events. 8534/12303 cut-off events. For 11036/11215 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 64332 event pairs, 1208 based on Foata normal form. 176/11272 useless extension candidates. Maximal degree in co-relation 33214. Up to 2798 conditions per place. [2025-03-14 01:03:47,771 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 212 selfloop transitions, 44 changer transitions 121/380 dead transitions. [2025-03-14 01:03:47,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 380 transitions, 2021 flow [2025-03-14 01:03:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-14 01:03:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-14 01:03:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 512 transitions. [2025-03-14 01:03:47,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35804195804195804 [2025-03-14 01:03:47,776 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 247 flow. Second operand 26 states and 512 transitions. [2025-03-14 01:03:47,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 380 transitions, 2021 flow [2025-03-14 01:03:47,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 380 transitions, 1961 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-03-14 01:03:47,863 INFO L231 Difference]: Finished difference. Result has 106 places, 95 transitions, 514 flow [2025-03-14 01:03:47,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=514, PETRI_PLACES=106, PETRI_TRANSITIONS=95} [2025-03-14 01:03:47,864 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2025-03-14 01:03:47,864 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 95 transitions, 514 flow [2025-03-14 01:03:47,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-14 01:03:47,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:47,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:47,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:03:47,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:47,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:47,865 INFO L85 PathProgramCache]: Analyzing trace with hash -859635324, now seen corresponding path program 1 times [2025-03-14 01:03:47,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:47,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526938427] [2025-03-14 01:03:47,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:03:47,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:47,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-14 01:03:47,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 01:03:47,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:03:47,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:03:48,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:48,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526938427] [2025-03-14 01:03:48,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526938427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:48,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:48,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:03:48,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775637707] [2025-03-14 01:03:48,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:48,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:03:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:48,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:03:48,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:03:48,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-03-14 01:03:48,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 95 transitions, 514 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-14 01:03:48,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:48,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-03-14 01:03:48,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:49,573 INFO L124 PetriNetUnfolderBase]: 10070/14581 cut-off events. [2025-03-14 01:03:49,573 INFO L125 PetriNetUnfolderBase]: For 41296/41464 co-relation queries the response was YES. [2025-03-14 01:03:49,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48861 conditions, 14581 events. 10070/14581 cut-off events. For 41296/41464 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 80303 event pairs, 1694 based on Foata normal form. 160/14053 useless extension candidates. Maximal degree in co-relation 48808. Up to 3978 conditions per place. [2025-03-14 01:03:49,644 INFO L140 encePairwiseOnDemand]: 39/55 looper letters, 217 selfloop transitions, 53 changer transitions 81/354 dead transitions. [2025-03-14 01:03:49,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 354 transitions, 2297 flow [2025-03-14 01:03:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 01:03:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 01:03:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 430 transitions. [2025-03-14 01:03:49,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2025-03-14 01:03:49,648 INFO L175 Difference]: Start difference. First operand has 106 places, 95 transitions, 514 flow. Second operand 20 states and 430 transitions. [2025-03-14 01:03:49,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 354 transitions, 2297 flow [2025-03-14 01:03:49,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 354 transitions, 2150 flow, removed 42 selfloop flow, removed 13 redundant places. [2025-03-14 01:03:49,793 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 744 flow [2025-03-14 01:03:49,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=744, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2025-03-14 01:03:49,795 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 59 predicate places. [2025-03-14 01:03:49,795 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 744 flow [2025-03-14 01:03:49,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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-14 01:03:49,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:49,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:49,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:03:49,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:49,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash -748002604, now seen corresponding path program 2 times [2025-03-14 01:03:49,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:49,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275040476] [2025-03-14 01:03:49,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:03:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:49,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-14 01:03:49,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 48 statements. [2025-03-14 01:03:49,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:03:49,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:03:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275040476] [2025-03-14 01:03:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275040476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:03:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087553160] [2025-03-14 01:03:49,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:49,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:03:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:49,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:03:49,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:03:49,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-03-14 01:03:49,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 744 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-14 01:03:49,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:49,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-03-14 01:03:49,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:50,909 INFO L124 PetriNetUnfolderBase]: 6108/8949 cut-off events. [2025-03-14 01:03:50,910 INFO L125 PetriNetUnfolderBase]: For 45064/45190 co-relation queries the response was YES. [2025-03-14 01:03:50,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35567 conditions, 8949 events. 6108/8949 cut-off events. For 45064/45190 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 46180 event pairs, 1405 based on Foata normal form. 289/9233 useless extension candidates. Maximal degree in co-relation 35518. Up to 5332 conditions per place. [2025-03-14 01:03:50,978 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 157 selfloop transitions, 28 changer transitions 0/195 dead transitions. [2025-03-14 01:03:50,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 195 transitions, 1550 flow [2025-03-14 01:03:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:03:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:03:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-03-14 01:03:50,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3795454545454545 [2025-03-14 01:03:50,980 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 744 flow. Second operand 8 states and 167 transitions. [2025-03-14 01:03:50,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 195 transitions, 1550 flow [2025-03-14 01:03:51,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 195 transitions, 1466 flow, removed 26 selfloop flow, removed 9 redundant places. [2025-03-14 01:03:51,141 INFO L231 Difference]: Finished difference. Result has 111 places, 119 transitions, 774 flow [2025-03-14 01:03:51,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=774, PETRI_PLACES=111, PETRI_TRANSITIONS=119} [2025-03-14 01:03:51,141 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 55 predicate places. [2025-03-14 01:03:51,143 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 119 transitions, 774 flow [2025-03-14 01:03:51,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-14 01:03:51,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:51,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:51,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:03:51,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1788312771, now seen corresponding path program 2 times [2025-03-14 01:03:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:51,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435199135] [2025-03-14 01:03:51,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:03:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:51,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-14 01:03:51,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 48 statements. [2025-03-14 01:03:51,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:03:51,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:03:51,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435199135] [2025-03-14 01:03:51,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435199135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:51,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:51,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:03:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449960042] [2025-03-14 01:03:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:51,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:03:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:51,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:03:51,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:03:51,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-03-14 01:03:51,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 119 transitions, 774 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-14 01:03:51,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:51,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-03-14 01:03:51,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:52,050 INFO L124 PetriNetUnfolderBase]: 3959/5907 cut-off events. [2025-03-14 01:03:52,051 INFO L125 PetriNetUnfolderBase]: For 29729/29921 co-relation queries the response was YES. [2025-03-14 01:03:52,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24329 conditions, 5907 events. 3959/5907 cut-off events. For 29729/29921 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 29849 event pairs, 1080 based on Foata normal form. 323/6215 useless extension candidates. Maximal degree in co-relation 24256. Up to 3173 conditions per place. [2025-03-14 01:03:52,090 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 152 selfloop transitions, 32 changer transitions 0/192 dead transitions. [2025-03-14 01:03:52,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 192 transitions, 1612 flow [2025-03-14 01:03:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:03:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:03:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-03-14 01:03:52,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3886363636363636 [2025-03-14 01:03:52,092 INFO L175 Difference]: Start difference. First operand has 111 places, 119 transitions, 774 flow. Second operand 8 states and 171 transitions. [2025-03-14 01:03:52,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 192 transitions, 1612 flow [2025-03-14 01:03:52,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 192 transitions, 1541 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-14 01:03:52,144 INFO L231 Difference]: Finished difference. Result has 113 places, 118 transitions, 809 flow [2025-03-14 01:03:52,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=809, PETRI_PLACES=113, PETRI_TRANSITIONS=118} [2025-03-14 01:03:52,145 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 57 predicate places. [2025-03-14 01:03:52,145 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 118 transitions, 809 flow [2025-03-14 01:03:52,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-14 01:03:52,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:52,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:52,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:03:52,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:52,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2125346036, now seen corresponding path program 1 times [2025-03-14 01:03:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84934902] [2025-03-14 01:03:52,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:03:52,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:52,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:03:52,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:03:52,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:03:52,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:03:52,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84934902] [2025-03-14 01:03:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84934902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:52,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 01:03:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21993626] [2025-03-14 01:03:52,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:52,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:03:52,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:52,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:03:52,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:03:52,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-14 01:03:52,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 118 transitions, 809 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-14 01:03:52,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:52,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-14 01:03:52,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:54,065 INFO L124 PetriNetUnfolderBase]: 5940/8692 cut-off events. [2025-03-14 01:03:54,065 INFO L125 PetriNetUnfolderBase]: For 47594/47612 co-relation queries the response was YES. [2025-03-14 01:03:54,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36958 conditions, 8692 events. 5940/8692 cut-off events. For 47594/47612 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 43366 event pairs, 1007 based on Foata normal form. 9/8701 useless extension candidates. Maximal degree in co-relation 36885. Up to 3670 conditions per place. [2025-03-14 01:03:54,121 INFO L140 encePairwiseOnDemand]: 39/55 looper letters, 228 selfloop transitions, 74 changer transitions 127/431 dead transitions. [2025-03-14 01:03:54,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 431 transitions, 3492 flow [2025-03-14 01:03:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-14 01:03:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-14 01:03:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 565 transitions. [2025-03-14 01:03:54,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27764127764127766 [2025-03-14 01:03:54,124 INFO L175 Difference]: Start difference. First operand has 113 places, 118 transitions, 809 flow. Second operand 37 states and 565 transitions. [2025-03-14 01:03:54,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 431 transitions, 3492 flow [2025-03-14 01:03:54,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 431 transitions, 3392 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-14 01:03:54,199 INFO L231 Difference]: Finished difference. Result has 159 places, 148 transitions, 1309 flow [2025-03-14 01:03:54,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1309, PETRI_PLACES=159, PETRI_TRANSITIONS=148} [2025-03-14 01:03:54,200 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 103 predicate places. [2025-03-14 01:03:54,200 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 148 transitions, 1309 flow [2025-03-14 01:03:54,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-14 01:03:54,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:54,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:54,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:03:54,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:54,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash 177176976, now seen corresponding path program 2 times [2025-03-14 01:03:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543686640] [2025-03-14 01:03:54,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:03:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:54,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:03:54,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:03:54,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:03:54,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:03:54,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:54,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543686640] [2025-03-14 01:03:54,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543686640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:54,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:54,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:03:54,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676636247] [2025-03-14 01:03:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:54,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:03:54,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:54,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:03:54,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:03:54,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-14 01:03:54,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 148 transitions, 1309 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-14 01:03:54,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:54,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-14 01:03:54,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:56,237 INFO L124 PetriNetUnfolderBase]: 7469/10936 cut-off events. [2025-03-14 01:03:56,237 INFO L125 PetriNetUnfolderBase]: For 123923/123941 co-relation queries the response was YES. [2025-03-14 01:03:56,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52633 conditions, 10936 events. 7469/10936 cut-off events. For 123923/123941 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 56794 event pairs, 806 based on Foata normal form. 10/10946 useless extension candidates. Maximal degree in co-relation 52573. Up to 3248 conditions per place. [2025-03-14 01:03:56,325 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 279 selfloop transitions, 94 changer transitions 118/493 dead transitions. [2025-03-14 01:03:56,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 493 transitions, 4551 flow [2025-03-14 01:03:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 01:03:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 01:03:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 552 transitions. [2025-03-14 01:03:56,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31363636363636366 [2025-03-14 01:03:56,328 INFO L175 Difference]: Start difference. First operand has 159 places, 148 transitions, 1309 flow. Second operand 32 states and 552 transitions. [2025-03-14 01:03:56,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 493 transitions, 4551 flow [2025-03-14 01:03:56,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 493 transitions, 4300 flow, removed 88 selfloop flow, removed 17 redundant places. [2025-03-14 01:03:56,551 INFO L231 Difference]: Finished difference. Result has 181 places, 183 transitions, 1827 flow [2025-03-14 01:03:56,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1827, PETRI_PLACES=181, PETRI_TRANSITIONS=183} [2025-03-14 01:03:56,552 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 125 predicate places. [2025-03-14 01:03:56,552 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 183 transitions, 1827 flow [2025-03-14 01:03:56,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-14 01:03:56,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:56,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:56,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:03:56,553 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:56,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2054214628, now seen corresponding path program 3 times [2025-03-14 01:03:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603027797] [2025-03-14 01:03:56,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:03:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:56,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:03:56,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 48 of 49 statements. [2025-03-14 01:03:56,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:03:56,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:03:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:56,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603027797] [2025-03-14 01:03:56,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603027797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:56,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:56,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 01:03:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747413649] [2025-03-14 01:03:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:56,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:03:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:56,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:03:56,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:03:56,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-14 01:03:56,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 183 transitions, 1827 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-14 01:03:56,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:56,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-14 01:03:56,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:03:58,897 INFO L124 PetriNetUnfolderBase]: 8757/12832 cut-off events. [2025-03-14 01:03:58,897 INFO L125 PetriNetUnfolderBase]: For 214505/214523 co-relation queries the response was YES. [2025-03-14 01:03:58,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70102 conditions, 12832 events. 8757/12832 cut-off events. For 214505/214523 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 68507 event pairs, 1498 based on Foata normal form. 10/12842 useless extension candidates. Maximal degree in co-relation 70013. Up to 5604 conditions per place. [2025-03-14 01:03:58,994 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 309 selfloop transitions, 121 changer transitions 87/519 dead transitions. [2025-03-14 01:03:58,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 519 transitions, 5369 flow [2025-03-14 01:03:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-14 01:03:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-14 01:03:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 582 transitions. [2025-03-14 01:03:58,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29393939393939394 [2025-03-14 01:03:58,996 INFO L175 Difference]: Start difference. First operand has 181 places, 183 transitions, 1827 flow. Second operand 36 states and 582 transitions. [2025-03-14 01:03:58,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 519 transitions, 5369 flow [2025-03-14 01:03:59,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 519 transitions, 4936 flow, removed 176 selfloop flow, removed 18 redundant places. [2025-03-14 01:03:59,537 INFO L231 Difference]: Finished difference. Result has 205 places, 223 transitions, 2470 flow [2025-03-14 01:03:59,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2470, PETRI_PLACES=205, PETRI_TRANSITIONS=223} [2025-03-14 01:03:59,538 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 149 predicate places. [2025-03-14 01:03:59,538 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 223 transitions, 2470 flow [2025-03-14 01:03:59,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-14 01:03:59,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:03:59,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:03:59,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:03:59,539 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:03:59,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:03:59,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1033493818, now seen corresponding path program 4 times [2025-03-14 01:03:59,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:03:59,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-14 01:03:59,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:03:59,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:03:59,549 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:03:59,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:03:59,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:03:59,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:03:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:03:59,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:03:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-14 01:03:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832597719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:03:59,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:03:59,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:03:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550223140] [2025-03-14 01:03:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:03:59,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:03:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:03:59,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:03:59,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:03:59,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-14 01:03:59,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 223 transitions, 2470 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-14 01:03:59,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:03:59,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-14 01:03:59,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:02,575 INFO L124 PetriNetUnfolderBase]: 12701/18548 cut-off events. [2025-03-14 01:04:02,575 INFO L125 PetriNetUnfolderBase]: For 381089/381107 co-relation queries the response was YES. [2025-03-14 01:04:02,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108128 conditions, 18548 events. 12701/18548 cut-off events. For 381089/381107 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 105259 event pairs, 1165 based on Foata normal form. 15/18391 useless extension candidates. Maximal degree in co-relation 108037. Up to 6771 conditions per place. [2025-03-14 01:04:02,742 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 332 selfloop transitions, 206 changer transitions 192/732 dead transitions. [2025-03-14 01:04:02,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 732 transitions, 8569 flow [2025-03-14 01:04:02,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-14 01:04:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-14 01:04:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 666 transitions. [2025-03-14 01:04:02,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27520661157024795 [2025-03-14 01:04:02,745 INFO L175 Difference]: Start difference. First operand has 205 places, 223 transitions, 2470 flow. Second operand 44 states and 666 transitions. [2025-03-14 01:04:02,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 732 transitions, 8569 flow [2025-03-14 01:04:03,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 732 transitions, 7976 flow, removed 215 selfloop flow, removed 21 redundant places. [2025-03-14 01:04:03,803 INFO L231 Difference]: Finished difference. Result has 239 places, 325 transitions, 4278 flow [2025-03-14 01:04:03,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4278, PETRI_PLACES=239, PETRI_TRANSITIONS=325} [2025-03-14 01:04:03,804 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 183 predicate places. [2025-03-14 01:04:03,804 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 325 transitions, 4278 flow [2025-03-14 01:04:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-14 01:04:03,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:03,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:03,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:04:03,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:04:03,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash 528180812, now seen corresponding path program 5 times [2025-03-14 01:04:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:03,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645625846] [2025-03-14 01:04:03,805 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:04:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:03,811 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:04:03,822 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:03,823 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:04:03,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:04:04,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:04,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645625846] [2025-03-14 01:04:04,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645625846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:04,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:04,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 01:04:04,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030974080] [2025-03-14 01:04:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:04,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:04:04,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:04,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:04:04,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:04:04,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-14 01:04:04,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 325 transitions, 4278 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-14 01:04:04,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:04,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-14 01:04:04,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:06,703 INFO L124 PetriNetUnfolderBase]: 10484/15502 cut-off events. [2025-03-14 01:04:06,703 INFO L125 PetriNetUnfolderBase]: For 378323/378341 co-relation queries the response was YES. [2025-03-14 01:04:06,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93454 conditions, 15502 events. 10484/15502 cut-off events. For 378323/378341 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 87604 event pairs, 1562 based on Foata normal form. 9/15386 useless extension candidates. Maximal degree in co-relation 93350. Up to 10551 conditions per place. [2025-03-14 01:04:06,872 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 351 selfloop transitions, 120 changer transitions 52/525 dead transitions. [2025-03-14 01:04:06,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 525 transitions, 6794 flow [2025-03-14 01:04:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 01:04:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 01:04:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 403 transitions. [2025-03-14 01:04:06,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3053030303030303 [2025-03-14 01:04:06,875 INFO L175 Difference]: Start difference. First operand has 239 places, 325 transitions, 4278 flow. Second operand 24 states and 403 transitions. [2025-03-14 01:04:06,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 525 transitions, 6794 flow [2025-03-14 01:04:08,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 525 transitions, 6232 flow, removed 202 selfloop flow, removed 21 redundant places. [2025-03-14 01:04:08,917 INFO L231 Difference]: Finished difference. Result has 235 places, 335 transitions, 4281 flow [2025-03-14 01:04:08,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3803, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4281, PETRI_PLACES=235, PETRI_TRANSITIONS=335} [2025-03-14 01:04:08,918 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 179 predicate places. [2025-03-14 01:04:08,918 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 335 transitions, 4281 flow [2025-03-14 01:04:08,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-14 01:04:08,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:08,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:08,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:04:08,918 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:04:08,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1285308994, now seen corresponding path program 6 times [2025-03-14 01:04:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:08,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43368891] [2025-03-14 01:04:08,919 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:04:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:08,928 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:04:08,935 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 48 of 49 statements. [2025-03-14 01:04:08,935 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:04:08,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:04:09,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:09,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43368891] [2025-03-14 01:04:09,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43368891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:09,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:09,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 01:04:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087301111] [2025-03-14 01:04:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:09,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:04:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:09,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:04:09,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:04:09,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-14 01:04:09,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 335 transitions, 4281 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-14 01:04:09,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:09,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-14 01:04:09,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:11,627 INFO L124 PetriNetUnfolderBase]: 10923/16151 cut-off events. [2025-03-14 01:04:11,628 INFO L125 PetriNetUnfolderBase]: For 390274/390292 co-relation queries the response was YES. [2025-03-14 01:04:11,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93967 conditions, 16151 events. 10923/16151 cut-off events. For 390274/390292 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 91578 event pairs, 1514 based on Foata normal form. 10/16036 useless extension candidates. Maximal degree in co-relation 93870. Up to 10447 conditions per place. [2025-03-14 01:04:11,730 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 356 selfloop transitions, 139 changer transitions 61/558 dead transitions. [2025-03-14 01:04:11,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 558 transitions, 7001 flow [2025-03-14 01:04:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-14 01:04:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-14 01:04:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 433 transitions. [2025-03-14 01:04:11,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2915824915824916 [2025-03-14 01:04:11,731 INFO L175 Difference]: Start difference. First operand has 235 places, 335 transitions, 4281 flow. Second operand 27 states and 433 transitions. [2025-03-14 01:04:11,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 558 transitions, 7001 flow [2025-03-14 01:04:12,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 558 transitions, 6749 flow, removed 40 selfloop flow, removed 20 redundant places. [2025-03-14 01:04:12,857 INFO L231 Difference]: Finished difference. Result has 244 places, 344 transitions, 4574 flow [2025-03-14 01:04:12,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=4044, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4574, PETRI_PLACES=244, PETRI_TRANSITIONS=344} [2025-03-14 01:04:12,858 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 188 predicate places. [2025-03-14 01:04:12,858 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 344 transitions, 4574 flow [2025-03-14 01:04:12,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-14 01:04:12,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:12,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:12,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:04:12,858 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:04:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1708847638, now seen corresponding path program 7 times [2025-03-14 01:04:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:12,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091017070] [2025-03-14 01:04:12,859 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:04:12,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:12,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:04:12,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:12,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:12,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:04:12,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:12,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091017070] [2025-03-14 01:04:12,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091017070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:04:12,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142155817] [2025-03-14 01:04:12,990 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:04:12,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:04:12,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:04:12,992 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-14 01:04:12,995 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-14 01:04:13,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:04:13,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:13,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:13,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 01:04:13,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:04:13,121 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 15 treesize of output 1 [2025-03-14 01:04:13,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-03-14 01:04:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:13,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:04:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:04:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142155817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:04:13,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:04:13,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 19 [2025-03-14 01:04:13,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333938697] [2025-03-14 01:04:13,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:04:13,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:04:13,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:13,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:04:13,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:04:13,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-03-14 01:04:13,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 344 transitions, 4574 flow. Second operand has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 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-14 01:04:13,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:13,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-03-14 01:04:13,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:16,144 INFO L124 PetriNetUnfolderBase]: 11139/16589 cut-off events. [2025-03-14 01:04:16,145 INFO L125 PetriNetUnfolderBase]: For 411467/411795 co-relation queries the response was YES. [2025-03-14 01:04:16,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98314 conditions, 16589 events. 11139/16589 cut-off events. For 411467/411795 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 98569 event pairs, 841 based on Foata normal form. 318/16782 useless extension candidates. Maximal degree in co-relation 98215. Up to 10810 conditions per place. [2025-03-14 01:04:16,302 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 447 selfloop transitions, 112 changer transitions 75/637 dead transitions. [2025-03-14 01:04:16,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 637 transitions, 8943 flow [2025-03-14 01:04:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:04:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:04:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 472 transitions. [2025-03-14 01:04:16,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28606060606060607 [2025-03-14 01:04:16,304 INFO L175 Difference]: Start difference. First operand has 244 places, 344 transitions, 4574 flow. Second operand 30 states and 472 transitions. [2025-03-14 01:04:16,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 637 transitions, 8943 flow [2025-03-14 01:04:17,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 637 transitions, 8653 flow, removed 79 selfloop flow, removed 19 redundant places. [2025-03-14 01:04:17,495 INFO L231 Difference]: Finished difference. Result has 261 places, 375 transitions, 5100 flow [2025-03-14 01:04:17,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=4399, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5100, PETRI_PLACES=261, PETRI_TRANSITIONS=375} [2025-03-14 01:04:17,496 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 205 predicate places. [2025-03-14 01:04:17,496 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 375 transitions, 5100 flow [2025-03-14 01:04:17,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 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-14 01:04:17,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:17,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:17,503 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-14 01:04:17,697 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-14 01:04:17,697 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:04:17,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:17,698 INFO L85 PathProgramCache]: Analyzing trace with hash 480228028, now seen corresponding path program 8 times [2025-03-14 01:04:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:17,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3285715] [2025-03-14 01:04:17,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:04:17,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:17,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:04:17,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:17,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:04:17,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:04:17,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3285715] [2025-03-14 01:04:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3285715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:17,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:04:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387495550] [2025-03-14 01:04:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:17,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:04:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:17,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:04:17,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:04:17,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-14 01:04:17,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 375 transitions, 5100 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-14 01:04:17,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:17,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-14 01:04:17,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:21,267 INFO L124 PetriNetUnfolderBase]: 12546/18639 cut-off events. [2025-03-14 01:04:21,267 INFO L125 PetriNetUnfolderBase]: For 497127/497145 co-relation queries the response was YES. [2025-03-14 01:04:21,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113150 conditions, 18639 events. 12546/18639 cut-off events. For 497127/497145 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 109259 event pairs, 2439 based on Foata normal form. 9/18502 useless extension candidates. Maximal degree in co-relation 113048. Up to 13315 conditions per place. [2025-03-14 01:04:21,410 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 402 selfloop transitions, 145 changer transitions 60/609 dead transitions. [2025-03-14 01:04:21,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 609 transitions, 8445 flow [2025-03-14 01:04:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 01:04:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 01:04:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 386 transitions. [2025-03-14 01:04:21,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30513833992094863 [2025-03-14 01:04:21,412 INFO L175 Difference]: Start difference. First operand has 261 places, 375 transitions, 5100 flow. Second operand 23 states and 386 transitions. [2025-03-14 01:04:21,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 609 transitions, 8445 flow [2025-03-14 01:04:23,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 609 transitions, 8274 flow, removed 63 selfloop flow, removed 10 redundant places. [2025-03-14 01:04:23,130 INFO L231 Difference]: Finished difference. Result has 275 places, 410 transitions, 5907 flow [2025-03-14 01:04:23,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=5008, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5907, PETRI_PLACES=275, PETRI_TRANSITIONS=410} [2025-03-14 01:04:23,131 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 219 predicate places. [2025-03-14 01:04:23,131 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 410 transitions, 5907 flow [2025-03-14 01:04:23,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-14 01:04:23,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:23,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:23,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:04:23,131 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:04:23,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1097940756, now seen corresponding path program 9 times [2025-03-14 01:04:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:23,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701546515] [2025-03-14 01:04:23,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:04:23,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:23,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:04:23,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 48 of 49 statements. [2025-03-14 01:04:23,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:04:23,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:04:23,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:23,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701546515] [2025-03-14 01:04:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701546515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:23,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:23,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 01:04:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197675808] [2025-03-14 01:04:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:23,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:04:23,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:23,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:04:23,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:04:23,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-03-14 01:04:23,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 410 transitions, 5907 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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-14 01:04:23,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:23,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-03-14 01:04:23,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:26,563 INFO L124 PetriNetUnfolderBase]: 13640/20368 cut-off events. [2025-03-14 01:04:26,563 INFO L125 PetriNetUnfolderBase]: For 593404/593722 co-relation queries the response was YES. [2025-03-14 01:04:26,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128551 conditions, 20368 events. 13640/20368 cut-off events. For 593404/593722 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 122249 event pairs, 2102 based on Foata normal form. 309/20531 useless extension candidates. Maximal degree in co-relation 128435. Up to 7162 conditions per place. [2025-03-14 01:04:26,742 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 392 selfloop transitions, 221 changer transitions 90/706 dead transitions. [2025-03-14 01:04:26,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 706 transitions, 10322 flow [2025-03-14 01:04:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 01:04:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 01:04:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 489 transitions. [2025-03-14 01:04:26,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31753246753246755 [2025-03-14 01:04:26,743 INFO L175 Difference]: Start difference. First operand has 275 places, 410 transitions, 5907 flow. Second operand 28 states and 489 transitions. [2025-03-14 01:04:26,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 706 transitions, 10322 flow [2025-03-14 01:04:28,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 706 transitions, 10031 flow, removed 57 selfloop flow, removed 13 redundant places. [2025-03-14 01:04:28,823 INFO L231 Difference]: Finished difference. Result has 294 places, 433 transitions, 6743 flow [2025-03-14 01:04:28,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=5682, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=6743, PETRI_PLACES=294, PETRI_TRANSITIONS=433} [2025-03-14 01:04:28,825 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 238 predicate places. [2025-03-14 01:04:28,825 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 433 transitions, 6743 flow [2025-03-14 01:04:28,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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-14 01:04:28,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:28,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:28,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:04:28,826 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:04:28,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:28,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1357345706, now seen corresponding path program 10 times [2025-03-14 01:04:28,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:28,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788786271] [2025-03-14 01:04:28,826 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:04:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:28,833 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-14 01:04:28,841 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:04:28,841 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:04:28,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:04:29,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788786271] [2025-03-14 01:04:29,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788786271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:29,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:29,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:04:29,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729068344] [2025-03-14 01:04:29,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:29,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:04:29,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:29,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:04:29,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:04:29,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2025-03-14 01:04:29,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 433 transitions, 6743 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-14 01:04:29,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:29,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2025-03-14 01:04:29,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:32,711 INFO L124 PetriNetUnfolderBase]: 13191/19618 cut-off events. [2025-03-14 01:04:32,711 INFO L125 PetriNetUnfolderBase]: For 605131/605145 co-relation queries the response was YES. [2025-03-14 01:04:32,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126045 conditions, 19618 events. 13191/19618 cut-off events. For 605131/605145 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 115416 event pairs, 1621 based on Foata normal form. 10/19522 useless extension candidates. Maximal degree in co-relation 125933. Up to 5862 conditions per place. [2025-03-14 01:04:32,881 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 349 selfloop transitions, 340 changer transitions 78/769 dead transitions. [2025-03-14 01:04:32,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 769 transitions, 11209 flow [2025-03-14 01:04:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-14 01:04:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-14 01:04:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 549 transitions. [2025-03-14 01:04:32,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26267942583732057 [2025-03-14 01:04:32,883 INFO L175 Difference]: Start difference. First operand has 294 places, 433 transitions, 6743 flow. Second operand 38 states and 549 transitions. [2025-03-14 01:04:32,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 769 transitions, 11209 flow [2025-03-14 01:04:35,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 769 transitions, 10743 flow, removed 120 selfloop flow, removed 17 redundant places. [2025-03-14 01:04:35,269 INFO L231 Difference]: Finished difference. Result has 313 places, 490 transitions, 8175 flow [2025-03-14 01:04:35,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=6368, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=290, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=8175, PETRI_PLACES=313, PETRI_TRANSITIONS=490} [2025-03-14 01:04:35,270 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 257 predicate places. [2025-03-14 01:04:35,270 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 490 transitions, 8175 flow [2025-03-14 01:04:35,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-14 01:04:35,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:35,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:35,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:04:35,271 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:04:35,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1128064906, now seen corresponding path program 11 times [2025-03-14 01:04:35,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876434120] [2025-03-14 01:04:35,271 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:04:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:35,278 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 3 equivalence classes. [2025-03-14 01:04:35,283 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:04:35,284 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:04:35,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:35,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:35,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876434120] [2025-03-14 01:04:35,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876434120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:04:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228833168] [2025-03-14 01:04:35,348 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:04:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:04:35,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:04:35,350 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-14 01:04:35,352 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-14 01:04:35,396 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 3 equivalence classes. [2025-03-14 01:04:35,422 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:04:35,422 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:04:35,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:35,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:04:35,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:04:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:35,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:04:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228833168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:04:35,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:04:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-14 01:04:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434756095] [2025-03-14 01:04:35,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:04:35,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:04:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:35,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:04:35,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:04:35,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-03-14 01:04:35,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 490 transitions, 8175 flow. Second operand has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 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-14 01:04:35,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:35,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-03-14 01:04:35,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:39,525 INFO L124 PetriNetUnfolderBase]: 15766/24407 cut-off events. [2025-03-14 01:04:39,525 INFO L125 PetriNetUnfolderBase]: For 500388/500665 co-relation queries the response was YES. [2025-03-14 01:04:39,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149721 conditions, 24407 events. 15766/24407 cut-off events. For 500388/500665 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 162299 event pairs, 7917 based on Foata normal form. 787/25021 useless extension candidates. Maximal degree in co-relation 149607. Up to 16951 conditions per place. [2025-03-14 01:04:39,730 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 456 selfloop transitions, 5 changer transitions 403/894 dead transitions. [2025-03-14 01:04:39,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 894 transitions, 16189 flow [2025-03-14 01:04:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:04:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:04:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2025-03-14 01:04:39,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-03-14 01:04:39,731 INFO L175 Difference]: Start difference. First operand has 313 places, 490 transitions, 8175 flow. Second operand 7 states and 160 transitions. [2025-03-14 01:04:39,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 894 transitions, 16189 flow [2025-03-14 01:04:43,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 894 transitions, 15620 flow, removed 158 selfloop flow, removed 22 redundant places. [2025-03-14 01:04:43,861 INFO L231 Difference]: Finished difference. Result has 296 places, 491 transitions, 7867 flow [2025-03-14 01:04:43,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=7819, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7867, PETRI_PLACES=296, PETRI_TRANSITIONS=491} [2025-03-14 01:04:43,862 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 240 predicate places. [2025-03-14 01:04:43,862 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 491 transitions, 7867 flow [2025-03-14 01:04:43,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 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-14 01:04:43,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:43,863 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:43,869 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-14 01:04:44,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:04:44,064 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:04:44,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash 114140244, now seen corresponding path program 12 times [2025-03-14 01:04:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954219515] [2025-03-14 01:04:44,065 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:04:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:44,070 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 3 equivalence classes. [2025-03-14 01:04:44,083 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:04:44,083 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 01:04:44,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:04:44,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:44,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954219515] [2025-03-14 01:04:44,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954219515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:04:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233827440] [2025-03-14 01:04:44,131 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:04:44,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:04:44,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:04:44,133 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:04:44,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:04:44,184 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 3 equivalence classes. [2025-03-14 01:04:44,208 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:04:44,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 01:04:44,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:44,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:04:44,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:04:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:04:44,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:04:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:04:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233827440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:04:44,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:04:44,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-14 01:04:44,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914185271] [2025-03-14 01:04:44,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:04:44,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:04:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:44,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:04:44,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:04:44,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-03-14 01:04:44,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 491 transitions, 7867 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-14 01:04:44,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:44,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-03-14 01:04:44,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:48,725 INFO L124 PetriNetUnfolderBase]: 16671/25126 cut-off events. [2025-03-14 01:04:48,725 INFO L125 PetriNetUnfolderBase]: For 644257/644316 co-relation queries the response was YES. [2025-03-14 01:04:48,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162549 conditions, 25126 events. 16671/25126 cut-off events. For 644257/644316 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 161260 event pairs, 753 based on Foata normal form. 179/25144 useless extension candidates. Maximal degree in co-relation 162395. Up to 6293 conditions per place. [2025-03-14 01:04:49,079 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 810 selfloop transitions, 107 changer transitions 153/1099 dead transitions. [2025-03-14 01:04:49,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 1099 transitions, 19560 flow [2025-03-14 01:04:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:04:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:04:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 313 transitions. [2025-03-14 01:04:49,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3793939393939394 [2025-03-14 01:04:49,080 INFO L175 Difference]: Start difference. First operand has 296 places, 491 transitions, 7867 flow. Second operand 15 states and 313 transitions. [2025-03-14 01:04:49,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 1099 transitions, 19560 flow [2025-03-14 01:04:53,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 1099 transitions, 19468 flow, removed 41 selfloop flow, removed 6 redundant places. [2025-03-14 01:04:53,497 INFO L231 Difference]: Finished difference. Result has 308 places, 571 transitions, 9143 flow [2025-03-14 01:04:53,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=7827, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9143, PETRI_PLACES=308, PETRI_TRANSITIONS=571} [2025-03-14 01:04:53,498 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 252 predicate places. [2025-03-14 01:04:53,498 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 571 transitions, 9143 flow [2025-03-14 01:04:53,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-14 01:04:53,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:53,498 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:53,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:04:53,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:04:53,699 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:04:53,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -870897524, now seen corresponding path program 13 times [2025-03-14 01:04:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:53,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830499040] [2025-03-14 01:04:53,700 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:04:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:53,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:04:53,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:04:53,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:53,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:04:53,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:53,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830499040] [2025-03-14 01:04:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830499040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:04:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029992708] [2025-03-14 01:04:53,806 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:04:53,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:04:53,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:04:53,808 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:04:53,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:04:53,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:04:53,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:04:53,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:53,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:53,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:04:53,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:04:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:04:53,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:04:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:04:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029992708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:04:54,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:04:54,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-14 01:04:54,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629085985] [2025-03-14 01:04:54,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:04:54,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:04:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:54,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:04:54,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:04:54,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-03-14 01:04:54,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 571 transitions, 9143 flow. Second operand has 15 states, 15 states have (on average 13.0) internal successors, (195), 15 states have internal predecessors, (195), 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-14 01:04:54,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:54,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-03-14 01:04:54,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand