./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:43:21,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:43:21,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:43:21,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:43:21,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:43:21,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:43:21,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:43:21,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:43:21,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:43:21,382 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:43:21,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:43:21,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:43:21,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:43:21,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:43:21,384 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:43:21,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:43:21,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:43:21,384 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:43:21,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:43:21,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:43:21,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:43:21,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:43:21,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:43:21,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:21,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:43:21,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:43:21,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:43:21,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:21,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:43:21,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:43:21,386 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:43:21,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:43:21,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:43:21,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:43:21,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:43:21,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:43:21,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:43:21,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:43:21,387 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 [2025-01-09 16:43:21,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:43:21,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:43:21,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:43:21,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:43:21,640 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:43:21,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-01-09 16:43:22,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a81cb2f4/2a48bbc825084b33a14aaf3af9ba9603/FLAGeaa430f3d [2025-01-09 16:43:23,124 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:43:23,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-01-09 16:43:23,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a81cb2f4/2a48bbc825084b33a14aaf3af9ba9603/FLAGeaa430f3d [2025-01-09 16:43:23,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a81cb2f4/2a48bbc825084b33a14aaf3af9ba9603 [2025-01-09 16:43:23,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:43:23,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:43:23,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:43:23,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:43:23,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:43:23,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af4f694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23, skipping insertion in model container [2025-01-09 16:43:23,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:43:23,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2218,2231] [2025-01-09 16:43:23,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:43:23,581 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:43:23,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2218,2231] [2025-01-09 16:43:23,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:43:23,612 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:43:23,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23 WrapperNode [2025-01-09 16:43:23,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:43:23,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:43:23,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:43:23,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:43:23,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,639 INFO L138 Inliner]: procedures = 20, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 88 [2025-01-09 16:43:23,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:43:23,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:43:23,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:43:23,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:43:23,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,663 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:43:23,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:43:23,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:43:23,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:43:23,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:43:23,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (1/1) ... [2025-01-09 16:43:23,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:23,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:23,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:43:23,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:43:23,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:43:23,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:43:23,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:43:23,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:43:23,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:43:23,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:43:23,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:43:23,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:43:23,727 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:43:23,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:43:23,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:43:23,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:43:23,728 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:43:23,798 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:43:23,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:43:23,949 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:43:23,949 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:43:24,036 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:43:24,036 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:43:24,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:24 BoogieIcfgContainer [2025-01-09 16:43:24,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:43:24,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:43:24,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:43:24,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:43:24,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:43:23" (1/3) ... [2025-01-09 16:43:24,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3a8505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:24, skipping insertion in model container [2025-01-09 16:43:24,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:23" (2/3) ... [2025-01-09 16:43:24,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3a8505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:24, skipping insertion in model container [2025-01-09 16:43:24,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:24" (3/3) ... [2025-01-09 16:43:24,045 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-01-09 16:43:24,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:43:24,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-determinism.wvr.c that has 5 procedures, 37 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:43:24,058 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:43:24,112 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:43:24,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 108 flow [2025-01-09 16:43:24,167 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-01-09 16:43:24,169 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:43:24,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 4/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-01-09 16:43:24,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 108 flow [2025-01-09 16:43:24,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 35 transitions, 94 flow [2025-01-09 16:43:24,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:43:24,189 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;@1e6bbc0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:43:24,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:43:24,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:43:24,204 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-01-09 16:43:24,204 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:43:24,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:24,205 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] [2025-01-09 16:43:24,205 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 2 more)] === [2025-01-09 16:43:24,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash 661783925, now seen corresponding path program 1 times [2025-01-09 16:43:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:24,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206100455] [2025-01-09 16:43:24,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:24,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:43:24,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:43:24,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:24,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:24,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:24,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206100455] [2025-01-09 16:43:24,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206100455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:24,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:43:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370282576] [2025-01-09 16:43:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:24,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:43:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:24,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:43:24,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:43:24,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:43:24,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:24,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:24,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:43:24,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:24,983 INFO L124 PetriNetUnfolderBase]: 5145/6895 cut-off events. [2025-01-09 16:43:24,984 INFO L125 PetriNetUnfolderBase]: For 518/518 co-relation queries the response was YES. [2025-01-09 16:43:24,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14126 conditions, 6895 events. 5145/6895 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 30666 event pairs, 1020 based on Foata normal form. 1/6282 useless extension candidates. Maximal degree in co-relation 12504. Up to 5288 conditions per place. [2025-01-09 16:43:25,025 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 51 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2025-01-09 16:43:25,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 279 flow [2025-01-09 16:43:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:43:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:43:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-01-09 16:43:25,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-01-09 16:43:25,037 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 94 flow. Second operand 3 states and 79 transitions. [2025-01-09 16:43:25,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 279 flow [2025-01-09 16:43:25,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 249 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:43:25,051 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 111 flow [2025-01-09 16:43:25,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2025-01-09 16:43:25,057 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-01-09 16:43:25,058 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 111 flow [2025-01-09 16:43:25,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:25,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:25,059 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] [2025-01-09 16:43:25,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:43:25,060 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 2 more)] === [2025-01-09 16:43:25,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2098068623, now seen corresponding path program 1 times [2025-01-09 16:43:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701369266] [2025-01-09 16:43:25,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:25,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:43:25,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:25,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:25,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701369266] [2025-01-09 16:43:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701369266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:25,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:43:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420315556] [2025-01-09 16:43:25,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:25,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:25,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:25,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:25,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:25,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:43:25,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:25,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:25,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:43:25,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:26,112 INFO L124 PetriNetUnfolderBase]: 11897/15399 cut-off events. [2025-01-09 16:43:26,113 INFO L125 PetriNetUnfolderBase]: For 1988/1988 co-relation queries the response was YES. [2025-01-09 16:43:26,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35070 conditions, 15399 events. 11897/15399 cut-off events. For 1988/1988 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 73007 event pairs, 3639 based on Foata normal form. 0/13185 useless extension candidates. Maximal degree in co-relation 5552. Up to 7867 conditions per place. [2025-01-09 16:43:26,258 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 101 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2025-01-09 16:43:26,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 113 transitions, 540 flow [2025-01-09 16:43:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-01-09 16:43:26,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-01-09 16:43:26,260 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 111 flow. Second operand 5 states and 128 transitions. [2025-01-09 16:43:26,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 113 transitions, 540 flow [2025-01-09 16:43:26,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 113 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:26,263 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 169 flow [2025-01-09 16:43:26,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2025-01-09 16:43:26,263 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-01-09 16:43:26,263 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 169 flow [2025-01-09 16:43:26,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:26,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:26,264 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] [2025-01-09 16:43:26,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:43:26,264 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 2 more)] === [2025-01-09 16:43:26,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash 796836777, now seen corresponding path program 2 times [2025-01-09 16:43:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:26,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65145527] [2025-01-09 16:43:26,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:26,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:26,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:43:26,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:26,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:26,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65145527] [2025-01-09 16:43:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65145527] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388030800] [2025-01-09 16:43:26,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:26,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:26,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:26,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:26,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:43:26,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:43:26,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:26,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:26,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:26,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:43:26,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:26,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:26,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388030800] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:26,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:26,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 16:43:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151501632] [2025-01-09 16:43:26,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:26,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:43:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:26,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:43:26,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:43:26,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:43:26,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:26,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:26,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:43:26,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:27,799 INFO L124 PetriNetUnfolderBase]: 16200/21115 cut-off events. [2025-01-09 16:43:27,799 INFO L125 PetriNetUnfolderBase]: For 7376/7376 co-relation queries the response was YES. [2025-01-09 16:43:27,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54831 conditions, 21115 events. 16200/21115 cut-off events. For 7376/7376 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 106564 event pairs, 1313 based on Foata normal form. 346/20629 useless extension candidates. Maximal degree in co-relation 27440. Up to 4494 conditions per place. [2025-01-09 16:43:27,897 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 260 selfloop transitions, 36 changer transitions 0/298 dead transitions. [2025-01-09 16:43:27,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 298 transitions, 1478 flow [2025-01-09 16:43:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:43:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:43:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 352 transitions. [2025-01-09 16:43:27,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-01-09 16:43:27,900 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 169 flow. Second operand 14 states and 352 transitions. [2025-01-09 16:43:27,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 298 transitions, 1478 flow [2025-01-09 16:43:27,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 298 transitions, 1478 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:43:27,913 INFO L231 Difference]: Finished difference. Result has 64 places, 76 transitions, 405 flow [2025-01-09 16:43:27,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=405, PETRI_PLACES=64, PETRI_TRANSITIONS=76} [2025-01-09 16:43:27,915 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2025-01-09 16:43:27,915 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 76 transitions, 405 flow [2025-01-09 16:43:27,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:27,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:27,915 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] [2025-01-09 16:43:27,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:43:28,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:28,118 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 2 more)] === [2025-01-09 16:43:28,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2061856191, now seen corresponding path program 1 times [2025-01-09 16:43:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174298596] [2025-01-09 16:43:28,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:28,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:43:28,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:28,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:28,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:28,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:28,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174298596] [2025-01-09 16:43:28,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174298596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:28,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:28,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:43:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880231337] [2025-01-09 16:43:28,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:28,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:43:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:28,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:43:28,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:43:28,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:43:28,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 76 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:28,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:28,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:43:28,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:28,858 INFO L124 PetriNetUnfolderBase]: 10020/13472 cut-off events. [2025-01-09 16:43:28,858 INFO L125 PetriNetUnfolderBase]: For 18139/18150 co-relation queries the response was YES. [2025-01-09 16:43:28,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41027 conditions, 13472 events. 10020/13472 cut-off events. For 18139/18150 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 67728 event pairs, 3355 based on Foata normal form. 571/13418 useless extension candidates. Maximal degree in co-relation 34360. Up to 9035 conditions per place. [2025-01-09 16:43:29,009 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 84 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2025-01-09 16:43:29,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 595 flow [2025-01-09 16:43:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:43:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:43:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-01-09 16:43:29,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-01-09 16:43:29,010 INFO L175 Difference]: Start difference. First operand has 64 places, 76 transitions, 405 flow. Second operand 3 states and 79 transitions. [2025-01-09 16:43:29,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 595 flow [2025-01-09 16:43:29,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 570 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-09 16:43:29,043 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 331 flow [2025-01-09 16:43:29,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2025-01-09 16:43:29,044 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2025-01-09 16:43:29,044 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 331 flow [2025-01-09 16:43:29,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:29,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:29,045 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] [2025-01-09 16:43:29,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:43:29,045 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 2 more)] === [2025-01-09 16:43:29,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1041281917, now seen corresponding path program 1 times [2025-01-09 16:43:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:29,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122258154] [2025-01-09 16:43:29,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:29,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:29,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:43:29,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:29,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:29,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:29,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:29,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122258154] [2025-01-09 16:43:29,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122258154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:29,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:29,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:43:29,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295016123] [2025-01-09 16:43:29,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:29,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:29,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:29,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:29,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:43:29,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:29,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:29,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:43:29,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:29,845 INFO L124 PetriNetUnfolderBase]: 12819/17261 cut-off events. [2025-01-09 16:43:29,845 INFO L125 PetriNetUnfolderBase]: For 19638/19638 co-relation queries the response was YES. [2025-01-09 16:43:29,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52867 conditions, 17261 events. 12819/17261 cut-off events. For 19638/19638 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 91060 event pairs, 4170 based on Foata normal form. 0/15758 useless extension candidates. Maximal degree in co-relation 44062. Up to 9052 conditions per place. [2025-01-09 16:43:29,918 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 113 selfloop transitions, 12 changer transitions 0/128 dead transitions. [2025-01-09 16:43:29,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 128 transitions, 762 flow [2025-01-09 16:43:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-01-09 16:43:29,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63 [2025-01-09 16:43:29,920 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 331 flow. Second operand 5 states and 126 transitions. [2025-01-09 16:43:29,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 128 transitions, 762 flow [2025-01-09 16:43:29,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 128 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:29,975 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 369 flow [2025-01-09 16:43:29,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2025-01-09 16:43:29,975 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2025-01-09 16:43:29,976 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 369 flow [2025-01-09 16:43:29,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:29,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:29,976 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] [2025-01-09 16:43:29,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:43:29,976 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 2 more)] === [2025-01-09 16:43:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash 108719653, now seen corresponding path program 2 times [2025-01-09 16:43:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551294609] [2025-01-09 16:43:29,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:29,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:43:29,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:29,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:43:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:30,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551294609] [2025-01-09 16:43:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551294609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:30,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:43:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686258210] [2025-01-09 16:43:30,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:30,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:30,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:30,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:30,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:43:30,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 369 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:30,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:30,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:43:30,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:31,021 INFO L124 PetriNetUnfolderBase]: 16993/22797 cut-off events. [2025-01-09 16:43:31,022 INFO L125 PetriNetUnfolderBase]: For 32554/32555 co-relation queries the response was YES. [2025-01-09 16:43:31,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73160 conditions, 22797 events. 16993/22797 cut-off events. For 32554/32555 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 120716 event pairs, 4445 based on Foata normal form. 0/20848 useless extension candidates. Maximal degree in co-relation 53791. Up to 9986 conditions per place. [2025-01-09 16:43:31,139 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 141 selfloop transitions, 18 changer transitions 0/162 dead transitions. [2025-01-09 16:43:31,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 162 transitions, 1114 flow [2025-01-09 16:43:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-01-09 16:43:31,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.635 [2025-01-09 16:43:31,140 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 369 flow. Second operand 5 states and 127 transitions. [2025-01-09 16:43:31,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 162 transitions, 1114 flow [2025-01-09 16:43:31,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 162 transitions, 1077 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:43:31,383 INFO L231 Difference]: Finished difference. Result has 73 places, 77 transitions, 473 flow [2025-01-09 16:43:31,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=473, PETRI_PLACES=73, PETRI_TRANSITIONS=77} [2025-01-09 16:43:31,384 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2025-01-09 16:43:31,384 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 473 flow [2025-01-09 16:43:31,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:31,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:31,384 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] [2025-01-09 16:43:31,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:43:31,385 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 2 more)] === [2025-01-09 16:43:31,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash -267284845, now seen corresponding path program 3 times [2025-01-09 16:43:31,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:31,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629811618] [2025-01-09 16:43:31,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:31,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:31,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:43:31,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:31,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:43:31,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:31,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629811618] [2025-01-09 16:43:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629811618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:31,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:31,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:43:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632617054] [2025-01-09 16:43:31,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:31,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:31,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:31,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:31,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:43:31,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 473 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:31,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:31,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:43:31,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:32,952 INFO L124 PetriNetUnfolderBase]: 20353/27251 cut-off events. [2025-01-09 16:43:32,952 INFO L125 PetriNetUnfolderBase]: For 61371/63635 co-relation queries the response was YES. [2025-01-09 16:43:32,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95543 conditions, 27251 events. 20353/27251 cut-off events. For 61371/63635 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 148349 event pairs, 7056 based on Foata normal form. 72/26173 useless extension candidates. Maximal degree in co-relation 81281. Up to 16228 conditions per place. [2025-01-09 16:43:33,052 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 135 selfloop transitions, 33 changer transitions 0/170 dead transitions. [2025-01-09 16:43:33,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 170 transitions, 1386 flow [2025-01-09 16:43:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-01-09 16:43:33,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-09 16:43:33,054 INFO L175 Difference]: Start difference. First operand has 73 places, 77 transitions, 473 flow. Second operand 5 states and 125 transitions. [2025-01-09 16:43:33,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 170 transitions, 1386 flow [2025-01-09 16:43:33,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 170 transitions, 1334 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:33,200 INFO L231 Difference]: Finished difference. Result has 79 places, 100 transitions, 747 flow [2025-01-09 16:43:33,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=79, PETRI_TRANSITIONS=100} [2025-01-09 16:43:33,200 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2025-01-09 16:43:33,200 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 100 transitions, 747 flow [2025-01-09 16:43:33,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:33,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:33,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] [2025-01-09 16:43:33,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:43:33,201 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 2 more)] === [2025-01-09 16:43:33,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash 248642525, now seen corresponding path program 3 times [2025-01-09 16:43:33,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:33,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482634606] [2025-01-09 16:43:33,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:33,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:43:33,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:33,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:43:33,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:33,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482634606] [2025-01-09 16:43:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482634606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:33,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:33,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:43:33,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701831470] [2025-01-09 16:43:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:33,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:33,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:33,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:33,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:33,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-01-09 16:43:33,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 100 transitions, 747 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:33,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:33,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-01-09 16:43:33,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:35,618 INFO L124 PetriNetUnfolderBase]: 36898/48150 cut-off events. [2025-01-09 16:43:35,618 INFO L125 PetriNetUnfolderBase]: For 130179/130179 co-relation queries the response was YES. [2025-01-09 16:43:35,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180458 conditions, 48150 events. 36898/48150 cut-off events. For 130179/130179 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 248283 event pairs, 13730 based on Foata normal form. 480/46642 useless extension candidates. Maximal degree in co-relation 155273. Up to 27514 conditions per place. [2025-01-09 16:43:35,870 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 175 selfloop transitions, 30 changer transitions 0/206 dead transitions. [2025-01-09 16:43:35,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 206 transitions, 1820 flow [2025-01-09 16:43:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-01-09 16:43:35,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-09 16:43:35,871 INFO L175 Difference]: Start difference. First operand has 79 places, 100 transitions, 747 flow. Second operand 5 states and 120 transitions. [2025-01-09 16:43:35,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 206 transitions, 1820 flow [2025-01-09 16:43:36,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 206 transitions, 1778 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:36,053 INFO L231 Difference]: Finished difference. Result has 85 places, 118 transitions, 1006 flow [2025-01-09 16:43:36,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1006, PETRI_PLACES=85, PETRI_TRANSITIONS=118} [2025-01-09 16:43:36,054 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2025-01-09 16:43:36,054 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 118 transitions, 1006 flow [2025-01-09 16:43:36,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:36,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:36,054 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] [2025-01-09 16:43:36,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:43:36,054 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 2 more)] === [2025-01-09 16:43:36,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1879864587, now seen corresponding path program 4 times [2025-01-09 16:43:36,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:36,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582523027] [2025-01-09 16:43:36,055 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:36,060 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:43:36,063 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-01-09 16:43:36,063 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:43:36,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582523027] [2025-01-09 16:43:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582523027] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76753255] [2025-01-09 16:43:36,087 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:36,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:36,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:36,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:36,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:43:36,122 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:43:36,134 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-01-09 16:43:36,134 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:43:36,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:36,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:43:36,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:36,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:36,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76753255] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:36,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:36,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-09 16:43:36,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025021286] [2025-01-09 16:43:36,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:36,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:43:36,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:36,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:43:36,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:43:36,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-01-09 16:43:36,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 118 transitions, 1006 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:36,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:36,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-01-09 16:43:36,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:39,811 INFO L124 PetriNetUnfolderBase]: 45044/59169 cut-off events. [2025-01-09 16:43:39,811 INFO L125 PetriNetUnfolderBase]: For 205020/205020 co-relation queries the response was YES. [2025-01-09 16:43:39,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237537 conditions, 59169 events. 45044/59169 cut-off events. For 205020/205020 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 321496 event pairs, 4080 based on Foata normal form. 390/57072 useless extension candidates. Maximal degree in co-relation 200297. Up to 14486 conditions per place. [2025-01-09 16:43:40,136 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 347 selfloop transitions, 110 changer transitions 0/458 dead transitions. [2025-01-09 16:43:40,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 458 transitions, 4248 flow [2025-01-09 16:43:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:43:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:43:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2025-01-09 16:43:40,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2025-01-09 16:43:40,142 INFO L175 Difference]: Start difference. First operand has 85 places, 118 transitions, 1006 flow. Second operand 11 states and 255 transitions. [2025-01-09 16:43:40,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 458 transitions, 4248 flow [2025-01-09 16:43:40,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 458 transitions, 4214 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-01-09 16:43:40,683 INFO L231 Difference]: Finished difference. Result has 100 places, 187 transitions, 2120 flow [2025-01-09 16:43:40,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2120, PETRI_PLACES=100, PETRI_TRANSITIONS=187} [2025-01-09 16:43:40,684 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2025-01-09 16:43:40,684 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 187 transitions, 2120 flow [2025-01-09 16:43:40,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:40,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:40,685 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] [2025-01-09 16:43:40,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:43:40,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:40,886 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 2 more)] === [2025-01-09 16:43:40,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash 955681789, now seen corresponding path program 1 times [2025-01-09 16:43:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737252665] [2025-01-09 16:43:40,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:40,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:43:40,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:40,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:40,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:40,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:40,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737252665] [2025-01-09 16:43:40,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737252665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:40,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:40,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:43:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053001362] [2025-01-09 16:43:40,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:40,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:43:40,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:40,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:43:40,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:43:40,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:43:40,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 187 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:40,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:40,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:43:40,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:43,478 INFO L124 PetriNetUnfolderBase]: 27745/38021 cut-off events. [2025-01-09 16:43:43,479 INFO L125 PetriNetUnfolderBase]: For 189387/191478 co-relation queries the response was YES. [2025-01-09 16:43:43,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161984 conditions, 38021 events. 27745/38021 cut-off events. For 189387/191478 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 218448 event pairs, 6544 based on Foata normal form. 68/36892 useless extension candidates. Maximal degree in co-relation 149337. Up to 25272 conditions per place. [2025-01-09 16:43:43,800 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 220 selfloop transitions, 3 changer transitions 12/252 dead transitions. [2025-01-09 16:43:43,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 252 transitions, 3216 flow [2025-01-09 16:43:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:43:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:43:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-01-09 16:43:43,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-09 16:43:43,802 INFO L175 Difference]: Start difference. First operand has 100 places, 187 transitions, 2120 flow. Second operand 3 states and 75 transitions. [2025-01-09 16:43:43,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 252 transitions, 3216 flow [2025-01-09 16:43:44,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 252 transitions, 3148 flow, removed 34 selfloop flow, removed 0 redundant places. [2025-01-09 16:43:44,291 INFO L231 Difference]: Finished difference. Result has 103 places, 178 transitions, 1936 flow [2025-01-09 16:43:44,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1936, PETRI_PLACES=103, PETRI_TRANSITIONS=178} [2025-01-09 16:43:44,291 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 59 predicate places. [2025-01-09 16:43:44,291 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 178 transitions, 1936 flow [2025-01-09 16:43:44,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:44,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:44,291 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] [2025-01-09 16:43:44,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:43:44,292 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 2 more)] === [2025-01-09 16:43:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1346129935, now seen corresponding path program 4 times [2025-01-09 16:43:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792381168] [2025-01-09 16:43:44,292 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:44,297 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:43:44,300 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-01-09 16:43:44,300 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:43:44,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:44,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:44,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792381168] [2025-01-09 16:43:44,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792381168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:44,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246094833] [2025-01-09 16:43:44,330 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:44,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:44,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:44,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:44,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:43:44,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:43:44,378 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-01-09 16:43:44,378 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:43:44,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:44,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:43:44,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:44,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246094833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:44,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:44,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 16:43:44,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338585592] [2025-01-09 16:43:44,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:44,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:43:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:44,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:43:44,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:43:44,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:43:44,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 178 transitions, 1936 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-01-09 16:43:44,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:44,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:43:44,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:47,440 INFO L124 PetriNetUnfolderBase]: 35161/47090 cut-off events. [2025-01-09 16:43:47,441 INFO L125 PetriNetUnfolderBase]: For 213070/215902 co-relation queries the response was YES. [2025-01-09 16:43:47,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199326 conditions, 47090 events. 35161/47090 cut-off events. For 213070/215902 co-relation queries the response was YES. Maximal size of possible extension queue 1380. Compared 265642 event pairs, 7643 based on Foata normal form. 774/47778 useless extension candidates. Maximal degree in co-relation 185599. Up to 17171 conditions per place. [2025-01-09 16:43:47,984 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 386 selfloop transitions, 47 changer transitions 0/438 dead transitions. [2025-01-09 16:43:47,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 438 transitions, 4942 flow [2025-01-09 16:43:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:43:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:43:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2025-01-09 16:43:47,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.628125 [2025-01-09 16:43:47,985 INFO L175 Difference]: Start difference. First operand has 103 places, 178 transitions, 1936 flow. Second operand 8 states and 201 transitions. [2025-01-09 16:43:47,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 438 transitions, 4942 flow [2025-01-09 16:43:48,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 438 transitions, 4856 flow, removed 30 selfloop flow, removed 3 redundant places. [2025-01-09 16:43:48,523 INFO L231 Difference]: Finished difference. Result has 109 places, 205 transitions, 2381 flow [2025-01-09 16:43:48,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2381, PETRI_PLACES=109, PETRI_TRANSITIONS=205} [2025-01-09 16:43:48,524 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 65 predicate places. [2025-01-09 16:43:48,524 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 205 transitions, 2381 flow [2025-01-09 16:43:48,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-01-09 16:43:48,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:48,524 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] [2025-01-09 16:43:48,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:43:48,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:48,731 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 2 more)] === [2025-01-09 16:43:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1626463395, now seen corresponding path program 5 times [2025-01-09 16:43:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271762187] [2025-01-09 16:43:48,732 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:43:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:48,739 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:43:48,744 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:48,744 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:43:48,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:48,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:48,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271762187] [2025-01-09 16:43:48,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271762187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:48,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:48,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:43:48,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514843897] [2025-01-09 16:43:48,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:48,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:48,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:48,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:48,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:43:48,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 205 transitions, 2381 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:48,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:48,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:43:48,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:52,392 INFO L124 PetriNetUnfolderBase]: 37248/49794 cut-off events. [2025-01-09 16:43:52,393 INFO L125 PetriNetUnfolderBase]: For 264674/265201 co-relation queries the response was YES. [2025-01-09 16:43:52,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223493 conditions, 49794 events. 37248/49794 cut-off events. For 264674/265201 co-relation queries the response was YES. Maximal size of possible extension queue 1548. Compared 285348 event pairs, 12246 based on Foata normal form. 546/50062 useless extension candidates. Maximal degree in co-relation 209113. Up to 31461 conditions per place. [2025-01-09 16:43:52,960 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 339 selfloop transitions, 29 changer transitions 0/389 dead transitions. [2025-01-09 16:43:52,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 389 transitions, 4758 flow [2025-01-09 16:43:52,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-01-09 16:43:52,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-09 16:43:52,961 INFO L175 Difference]: Start difference. First operand has 109 places, 205 transitions, 2381 flow. Second operand 5 states and 120 transitions. [2025-01-09 16:43:52,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 389 transitions, 4758 flow [2025-01-09 16:43:53,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 389 transitions, 4618 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:53,649 INFO L231 Difference]: Finished difference. Result has 114 places, 211 transitions, 2443 flow [2025-01-09 16:43:53,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2334, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2443, PETRI_PLACES=114, PETRI_TRANSITIONS=211} [2025-01-09 16:43:53,651 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places. [2025-01-09 16:43:53,651 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 211 transitions, 2443 flow [2025-01-09 16:43:53,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:53,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:53,651 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] [2025-01-09 16:43:53,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:43:53,652 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 2 more)] === [2025-01-09 16:43:53,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1643804637, now seen corresponding path program 6 times [2025-01-09 16:43:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382699149] [2025-01-09 16:43:53,652 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:43:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:53,657 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:43:53,660 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:53,660 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:43:53,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:53,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:53,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382699149] [2025-01-09 16:43:53,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382699149] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:53,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007298021] [2025-01-09 16:43:53,707 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:43:53,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:53,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:53,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:53,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:43:53,744 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:43:53,758 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:43:53,758 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:43:53,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:53,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:43:53,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:53,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:53,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007298021] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:53,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:53,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-01-09 16:43:53,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621310060] [2025-01-09 16:43:53,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:53,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:43:53,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:53,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:43:53,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:43:53,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-01-09 16:43:53,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 211 transitions, 2443 flow. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:53,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:53,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-01-09 16:43:53,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:58,233 INFO L124 PetriNetUnfolderBase]: 45241/59835 cut-off events. [2025-01-09 16:43:58,233 INFO L125 PetriNetUnfolderBase]: For 323996/323996 co-relation queries the response was YES. [2025-01-09 16:43:58,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279646 conditions, 59835 events. 45241/59835 cut-off events. For 323996/323996 co-relation queries the response was YES. Maximal size of possible extension queue 1619. Compared 331398 event pairs, 11102 based on Foata normal form. 588/60423 useless extension candidates. Maximal degree in co-relation 268004. Up to 22704 conditions per place. [2025-01-09 16:43:58,797 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 239 selfloop transitions, 121 changer transitions 0/361 dead transitions. [2025-01-09 16:43:58,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 361 transitions, 4138 flow [2025-01-09 16:43:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:43:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:43:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2025-01-09 16:43:58,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.609375 [2025-01-09 16:43:58,799 INFO L175 Difference]: Start difference. First operand has 114 places, 211 transitions, 2443 flow. Second operand 8 states and 195 transitions. [2025-01-09 16:43:58,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 361 transitions, 4138 flow [2025-01-09 16:43:59,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 361 transitions, 4092 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:43:59,968 INFO L231 Difference]: Finished difference. Result has 121 places, 216 transitions, 2792 flow [2025-01-09 16:43:59,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2309, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2792, PETRI_PLACES=121, PETRI_TRANSITIONS=216} [2025-01-09 16:43:59,969 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places. [2025-01-09 16:43:59,969 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 216 transitions, 2792 flow [2025-01-09 16:43:59,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:59,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:59,969 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] [2025-01-09 16:43:59,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:44:00,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 16:44:00,170 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 2 more)] === [2025-01-09 16:44:00,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1007984341, now seen corresponding path program 5 times [2025-01-09 16:44:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:00,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799932501] [2025-01-09 16:44:00,171 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:44:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:00,174 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:44:00,177 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:44:00,177 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:44:00,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:00,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:00,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799932501] [2025-01-09 16:44:00,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799932501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:00,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:00,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:44:00,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754952798] [2025-01-09 16:44:00,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:00,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:44:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:00,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:44:00,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:44:00,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:44:00,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 216 transitions, 2792 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:00,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:00,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:44:00,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand