./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.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 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:42:00,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:42:00,368 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:42:00,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:42:00,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:42:00,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:42:00,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:42:00,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:42:00,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:42:00,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:42:00,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:42:00,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:42:00,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:42:00,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:42:00,386 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:42:00,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:42:00,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:42:00,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:42:00,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:42:00,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:00,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:00,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:42:00,388 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:42:00,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:42:00,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:42:00,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:42:00,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:42:00,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:42:00,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:42:00,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:42:00,389 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 -> 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 [2025-01-09 16:42:00,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:42:00,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:42:00,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:42:00,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:42:00,627 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:42:00,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-01-09 16:42:01,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad5c91e0a/7f4809caad1449169b387cbfeeaaefa7/FLAG4168548fb [2025-01-09 16:42:01,994 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:42:01,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-01-09 16:42:02,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad5c91e0a/7f4809caad1449169b387cbfeeaaefa7/FLAG4168548fb [2025-01-09 16:42:02,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad5c91e0a/7f4809caad1449169b387cbfeeaaefa7 [2025-01-09 16:42:02,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:42:02,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:42:02,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:02,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:42:02,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:42:02,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b1c57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02, skipping insertion in model container [2025-01-09 16:42:02,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:42:02,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-01-09 16:42:02,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:02,479 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:42:02,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-01-09 16:42:02,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:02,508 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:42:02,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02 WrapperNode [2025-01-09 16:42:02,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:02,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:02,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:42:02,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:42:02,514 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:42:02" (1/1) ... [2025-01-09 16:42:02,519 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:42:02" (1/1) ... [2025-01-09 16:42:02,533 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2025-01-09 16:42:02,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:02,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:42:02,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:42:02,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:42:02,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,550 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:42:02,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:42:02,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:42:02,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:42:02,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:42:02,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (1/1) ... [2025-01-09 16:42:02,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:02,590 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:42:02,593 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:42:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:42:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:42:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:42:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:42:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:42:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:42:02,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:42:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:42:02,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:42:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:42:02,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:42:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:42:02,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:42:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:42:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:42:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:42:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:42:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:42:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:42:02,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:42:02,613 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:42:02,696 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:42:02,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:42:02,957 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:42:02,957 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:42:03,208 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:42:03,210 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 16:42:03,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:03 BoogieIcfgContainer [2025-01-09 16:42:03,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:42:03,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:42:03,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:42:03,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:42:03,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:42:02" (1/3) ... [2025-01-09 16:42:03,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231f424d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:03, skipping insertion in model container [2025-01-09 16:42:03,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:02" (2/3) ... [2025-01-09 16:42:03,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231f424d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:03, skipping insertion in model container [2025-01-09 16:42:03,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:03" (3/3) ... [2025-01-09 16:42:03,219 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-01-09 16:42:03,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:42:03,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 48 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:42:03,232 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:42:03,293 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-01-09 16:42:03,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 59 transitions, 158 flow [2025-01-09 16:42:03,344 INFO L124 PetriNetUnfolderBase]: 9/52 cut-off events. [2025-01-09 16:42:03,346 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:42:03,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 52 events. 9/52 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-01-09 16:42:03,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 59 transitions, 158 flow [2025-01-09 16:42:03,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 51 transitions, 132 flow [2025-01-09 16:42:03,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:42:03,366 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;@fdb8911, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:42:03,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:42:03,382 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:42:03,382 INFO L124 PetriNetUnfolderBase]: 9/50 cut-off events. [2025-01-09 16:42:03,382 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:42:03,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:03,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:03,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:03,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash 203783188, now seen corresponding path program 1 times [2025-01-09 16:42:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:03,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981955868] [2025-01-09 16:42:03,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:03,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:42:03,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:42:03,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:03,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:03,563 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:42:03,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981955868] [2025-01-09 16:42:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981955868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:03,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:42:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99460617] [2025-01-09 16:42:03,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:03,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:42:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:03,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:42:03,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:42:03,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:03,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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:42:03,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:03,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:03,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:04,557 INFO L124 PetriNetUnfolderBase]: 8088/10948 cut-off events. [2025-01-09 16:42:04,559 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-01-09 16:42:04,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22845 conditions, 10948 events. 8088/10948 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 51575 event pairs, 6978 based on Foata normal form. 0/9835 useless extension candidates. Maximal degree in co-relation 22783. Up to 10923 conditions per place. [2025-01-09 16:42:04,625 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 44 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2025-01-09 16:42:04,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 214 flow [2025-01-09 16:42:04,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:42:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:42:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2025-01-09 16:42:04,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5163934426229508 [2025-01-09 16:42:04,637 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 132 flow. Second operand 2 states and 63 transitions. [2025-01-09 16:42:04,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 214 flow [2025-01-09 16:42:04,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:42:04,649 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 106 flow [2025-01-09 16:42:04,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-01-09 16:42:04,653 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2025-01-09 16:42:04,653 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 106 flow [2025-01-09 16:42:04,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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:42:04,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:04,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:04,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:42:04,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:04,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1532355161, now seen corresponding path program 1 times [2025-01-09 16:42:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105371126] [2025-01-09 16:42:04,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:04,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:42:04,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:42:04,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:04,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:04,868 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:42:04,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:04,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105371126] [2025-01-09 16:42:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105371126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:42:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335402065] [2025-01-09 16:42:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:04,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:42:04,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:04,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:42:04,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:42:04,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:04,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:42:04,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:04,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:04,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:06,312 INFO L124 PetriNetUnfolderBase]: 19350/26141 cut-off events. [2025-01-09 16:42:06,312 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2025-01-09 16:42:06,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52854 conditions, 26141 events. 19350/26141 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 141917 event pairs, 6122 based on Foata normal form. 1/23284 useless extension candidates. Maximal degree in co-relation 52851. Up to 11645 conditions per place. [2025-01-09 16:42:06,418 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 106 selfloop transitions, 7 changer transitions 1/118 dead transitions. [2025-01-09 16:42:06,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 118 transitions, 490 flow [2025-01-09 16:42:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:42:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:42:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-01-09 16:42:06,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6024590163934426 [2025-01-09 16:42:06,421 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 106 flow. Second operand 4 states and 147 transitions. [2025-01-09 16:42:06,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 118 transitions, 490 flow [2025-01-09 16:42:06,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 118 transitions, 490 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:42:06,426 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 151 flow [2025-01-09 16:42:06,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2025-01-09 16:42:06,427 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2025-01-09 16:42:06,427 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 151 flow [2025-01-09 16:42:06,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:42:06,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:06,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:06,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:42:06,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:06,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:06,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1738820913, now seen corresponding path program 2 times [2025-01-09 16:42:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386523282] [2025-01-09 16:42:06,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:06,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:42:06,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:42:06,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:06,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:06,597 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:42:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386523282] [2025-01-09 16:42:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386523282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:06,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:42:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939426173] [2025-01-09 16:42:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:42:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:06,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:42:06,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:42:06,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:06,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:42:06,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:06,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:06,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:08,368 INFO L124 PetriNetUnfolderBase]: 30683/41318 cut-off events. [2025-01-09 16:42:08,369 INFO L125 PetriNetUnfolderBase]: For 4030/4030 co-relation queries the response was YES. [2025-01-09 16:42:08,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89848 conditions, 41318 events. 30683/41318 cut-off events. For 4030/4030 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 231149 event pairs, 14006 based on Foata normal form. 1/36758 useless extension candidates. Maximal degree in co-relation 89842. Up to 19516 conditions per place. [2025-01-09 16:42:08,616 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 112 selfloop transitions, 8 changer transitions 1/125 dead transitions. [2025-01-09 16:42:08,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 125 transitions, 570 flow [2025-01-09 16:42:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:42:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:42:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-01-09 16:42:08,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6065573770491803 [2025-01-09 16:42:08,619 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 151 flow. Second operand 4 states and 148 transitions. [2025-01-09 16:42:08,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 125 transitions, 570 flow [2025-01-09 16:42:08,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 125 transitions, 570 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:42:08,624 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 211 flow [2025-01-09 16:42:08,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2025-01-09 16:42:08,625 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2025-01-09 16:42:08,626 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 211 flow [2025-01-09 16:42:08,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:42:08,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:08,626 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:08,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:42:08,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:08,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1981637459, now seen corresponding path program 1 times [2025-01-09 16:42:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:08,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761099595] [2025-01-09 16:42:08,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:08,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:08,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:42:08,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:08,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:08,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:08,889 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:42:08,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:08,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761099595] [2025-01-09 16:42:08,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761099595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:08,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:08,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:42:08,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624103890] [2025-01-09 16:42:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:08,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:08,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:08,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:08,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:08,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:08,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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:42:08,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:08,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:08,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:11,443 INFO L124 PetriNetUnfolderBase]: 42068/57206 cut-off events. [2025-01-09 16:42:11,443 INFO L125 PetriNetUnfolderBase]: For 16662/16666 co-relation queries the response was YES. [2025-01-09 16:42:11,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128512 conditions, 57206 events. 42068/57206 cut-off events. For 16662/16666 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 336868 event pairs, 32096 based on Foata normal form. 1244/51696 useless extension candidates. Maximal degree in co-relation 128503. Up to 41253 conditions per place. [2025-01-09 16:42:11,639 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 102 selfloop transitions, 5 changer transitions 2/113 dead transitions. [2025-01-09 16:42:11,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 113 transitions, 601 flow [2025-01-09 16:42:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-01-09 16:42:11,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4459016393442623 [2025-01-09 16:42:11,641 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 211 flow. Second operand 5 states and 136 transitions. [2025-01-09 16:42:11,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 113 transitions, 601 flow [2025-01-09 16:42:11,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 597 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 16:42:11,657 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 259 flow [2025-01-09 16:42:11,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-01-09 16:42:11,658 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2025-01-09 16:42:11,658 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 259 flow [2025-01-09 16:42:11,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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:42:11,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:11,659 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:11,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:42:11,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:11,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1452384882, now seen corresponding path program 1 times [2025-01-09 16:42:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329011848] [2025-01-09 16:42:11,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:11,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:42:11,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:11,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:11,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:11,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:11,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329011848] [2025-01-09 16:42:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329011848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:42:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948121538] [2025-01-09 16:42:11,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:11,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:11,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:11,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:11,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:11,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:11,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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:42:11,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:11,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:11,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:14,324 INFO L124 PetriNetUnfolderBase]: 37183/50532 cut-off events. [2025-01-09 16:42:14,324 INFO L125 PetriNetUnfolderBase]: For 15405/15405 co-relation queries the response was YES. [2025-01-09 16:42:14,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115709 conditions, 50532 events. 37183/50532 cut-off events. For 15405/15405 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 292452 event pairs, 28958 based on Foata normal form. 382/44997 useless extension candidates. Maximal degree in co-relation 115696. Up to 41253 conditions per place. [2025-01-09 16:42:14,507 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 54 selfloop transitions, 2 changer transitions 60/120 dead transitions. [2025-01-09 16:42:14,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 120 transitions, 634 flow [2025-01-09 16:42:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-01-09 16:42:14,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47540983606557374 [2025-01-09 16:42:14,513 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 259 flow. Second operand 5 states and 145 transitions. [2025-01-09 16:42:14,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 120 transitions, 634 flow [2025-01-09 16:42:14,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 630 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:14,535 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 235 flow [2025-01-09 16:42:14,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-01-09 16:42:14,536 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 15 predicate places. [2025-01-09 16:42:14,536 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 235 flow [2025-01-09 16:42:14,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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:42:14,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:14,536 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:14,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:42:14,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:14,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1602572723, now seen corresponding path program 1 times [2025-01-09 16:42:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:14,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361222364] [2025-01-09 16:42:14,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:14,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 16:42:14,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 16:42:14,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:14,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:14,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:14,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361222364] [2025-01-09 16:42:14,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361222364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:14,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47365652] [2025-01-09 16:42:14,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:14,632 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:42:14,633 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:42:14,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 16:42:14,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 16:42:14,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:14,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:14,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 16:42:14,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:14,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47365652] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:14,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-09 16:42:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455221341] [2025-01-09 16:42:14,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:14,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:42:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:14,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:42:14,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:42:14,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:14,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 235 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 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:42:14,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:14,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:14,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:17,778 INFO L124 PetriNetUnfolderBase]: 46892/63464 cut-off events. [2025-01-09 16:42:17,778 INFO L125 PetriNetUnfolderBase]: For 28393/28393 co-relation queries the response was YES. [2025-01-09 16:42:17,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149702 conditions, 63464 events. 46892/63464 cut-off events. For 28393/28393 co-relation queries the response was YES. Maximal size of possible extension queue 1831. Compared 382598 event pairs, 24105 based on Foata normal form. 799/57084 useless extension candidates. Maximal degree in co-relation 149687. Up to 30623 conditions per place. [2025-01-09 16:42:18,120 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 159 selfloop transitions, 7 changer transitions 1/171 dead transitions. [2025-01-09 16:42:18,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 171 transitions, 955 flow [2025-01-09 16:42:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:42:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:42:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2025-01-09 16:42:18,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46604215456674475 [2025-01-09 16:42:18,122 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 235 flow. Second operand 7 states and 199 transitions. [2025-01-09 16:42:18,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 171 transitions, 955 flow [2025-01-09 16:42:18,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 171 transitions, 929 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-01-09 16:42:18,233 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 284 flow [2025-01-09 16:42:18,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=284, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-01-09 16:42:18,233 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2025-01-09 16:42:18,233 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 284 flow [2025-01-09 16:42:18,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 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:42:18,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:18,234 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:18,402 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:42:18,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:18,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:18,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1460041907, now seen corresponding path program 1 times [2025-01-09 16:42:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:18,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560891949] [2025-01-09 16:42:18,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:18,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:18,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 16:42:18,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 16:42:18,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:18,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:18,531 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:42:18,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:18,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560891949] [2025-01-09 16:42:18,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560891949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:18,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592209978] [2025-01-09 16:42:18,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:18,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:18,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:18,534 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:42:18,536 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:42:18,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 16:42:18,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 16:42:18,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:18,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:18,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 16:42:18,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:18,709 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:42:18,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:18,774 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:42:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592209978] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:18,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:18,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-09 16:42:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141793690] [2025-01-09 16:42:18,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:18,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:42:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:18,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:42:18,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:42:18,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:18,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 284 flow. Second operand has 12 states, 12 states have (on average 13.583333333333334) internal successors, (163), 12 states have internal predecessors, (163), 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:42:18,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:18,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:18,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:21,428 INFO L124 PetriNetUnfolderBase]: 36481/49836 cut-off events. [2025-01-09 16:42:21,429 INFO L125 PetriNetUnfolderBase]: For 23228/23232 co-relation queries the response was YES. [2025-01-09 16:42:21,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118928 conditions, 49836 events. 36481/49836 cut-off events. For 23228/23232 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 291893 event pairs, 17518 based on Foata normal form. 1460/45364 useless extension candidates. Maximal degree in co-relation 118913. Up to 21141 conditions per place. [2025-01-09 16:42:21,660 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 84 selfloop transitions, 5 changer transitions 47/140 dead transitions. [2025-01-09 16:42:21,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 807 flow [2025-01-09 16:42:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:42:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:42:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-01-09 16:42:21,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40749414519906324 [2025-01-09 16:42:21,664 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 284 flow. Second operand 7 states and 174 transitions. [2025-01-09 16:42:21,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 807 flow [2025-01-09 16:42:21,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 140 transitions, 799 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:21,680 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 278 flow [2025-01-09 16:42:21,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2025-01-09 16:42:21,681 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2025-01-09 16:42:21,681 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 278 flow [2025-01-09 16:42:21,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.583333333333334) internal successors, (163), 12 states have internal predecessors, (163), 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:42:21,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:21,681 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:21,687 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:42:21,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:21,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:21,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:21,883 INFO L85 PathProgramCache]: Analyzing trace with hash -983549104, now seen corresponding path program 2 times [2025-01-09 16:42:21,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:21,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188005490] [2025-01-09 16:42:21,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:21,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:21,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:42:21,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:42:21,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:21,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188005490] [2025-01-09 16:42:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188005490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019321548] [2025-01-09 16:42:22,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:22,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:22,007 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:42:22,009 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:42:22,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:42:22,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:42:22,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:22,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:22,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 16:42:22,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:22,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:22,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019321548] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:22,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:42:22,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-01-09 16:42:22,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883618392] [2025-01-09 16:42:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:22,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:42:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:22,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:42:22,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:42:22,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:22,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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:42:22,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:22,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:22,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:23,804 INFO L124 PetriNetUnfolderBase]: 23295/31570 cut-off events. [2025-01-09 16:42:23,804 INFO L125 PetriNetUnfolderBase]: For 25033/25037 co-relation queries the response was YES. [2025-01-09 16:42:23,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84389 conditions, 31570 events. 23295/31570 cut-off events. For 25033/25037 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 170964 event pairs, 11465 based on Foata normal form. 830/28861 useless extension candidates. Maximal degree in co-relation 84370. Up to 24878 conditions per place. [2025-01-09 16:42:23,937 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 76 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2025-01-09 16:42:23,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 87 transitions, 534 flow [2025-01-09 16:42:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:42:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:42:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-01-09 16:42:23,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3224043715846995 [2025-01-09 16:42:23,939 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 278 flow. Second operand 6 states and 118 transitions. [2025-01-09 16:42:23,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 87 transitions, 534 flow [2025-01-09 16:42:24,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 488 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-01-09 16:42:24,017 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 280 flow [2025-01-09 16:42:24,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2025-01-09 16:42:24,018 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2025-01-09 16:42:24,018 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 280 flow [2025-01-09 16:42:24,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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:42:24,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:24,018 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:24,024 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:42:24,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:24,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:24,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1300039420, now seen corresponding path program 2 times [2025-01-09 16:42:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951738893] [2025-01-09 16:42:24,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:24,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:42:24,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 42 statements. [2025-01-09 16:42:24,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:24,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:24,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:24,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951738893] [2025-01-09 16:42:24,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951738893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:24,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:24,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573959935] [2025-01-09 16:42:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:24,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:24,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:24,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:24,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:24,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:42:24,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:24,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:24,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:26,150 INFO L124 PetriNetUnfolderBase]: 27479/37172 cut-off events. [2025-01-09 16:42:26,150 INFO L125 PetriNetUnfolderBase]: For 18917/18921 co-relation queries the response was YES. [2025-01-09 16:42:26,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95195 conditions, 37172 events. 27479/37172 cut-off events. For 18917/18921 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 203423 event pairs, 3785 based on Foata normal form. 361/33243 useless extension candidates. Maximal degree in co-relation 95180. Up to 24748 conditions per place. [2025-01-09 16:42:26,315 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 119 selfloop transitions, 7 changer transitions 1/131 dead transitions. [2025-01-09 16:42:26,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 131 transitions, 746 flow [2025-01-09 16:42:26,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-01-09 16:42:26,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4786885245901639 [2025-01-09 16:42:26,316 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 280 flow. Second operand 5 states and 146 transitions. [2025-01-09 16:42:26,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 131 transitions, 746 flow [2025-01-09 16:42:26,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 131 transitions, 726 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 16:42:26,363 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 312 flow [2025-01-09 16:42:26,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-01-09 16:42:26,363 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2025-01-09 16:42:26,363 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 312 flow [2025-01-09 16:42:26,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:42:26,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:26,364 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:26,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:42:26,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:26,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1813838146, now seen corresponding path program 3 times [2025-01-09 16:42:26,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:26,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074681899] [2025-01-09 16:42:26,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:42:26,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:26,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:42:26,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 40 of 42 statements. [2025-01-09 16:42:26,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:42:26,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:26,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074681899] [2025-01-09 16:42:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074681899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:26,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:26,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214033846] [2025-01-09 16:42:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:26,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:26,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:26,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:26,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:26,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:42:26,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:26,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:26,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:28,540 INFO L124 PetriNetUnfolderBase]: 27407/37118 cut-off events. [2025-01-09 16:42:28,541 INFO L125 PetriNetUnfolderBase]: For 28399/28403 co-relation queries the response was YES. [2025-01-09 16:42:28,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97277 conditions, 37118 events. 27407/37118 cut-off events. For 28399/28403 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 205486 event pairs, 12393 based on Foata normal form. 74/32906 useless extension candidates. Maximal degree in co-relation 97260. Up to 30429 conditions per place. [2025-01-09 16:42:28,708 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 95 selfloop transitions, 8 changer transitions 14/121 dead transitions. [2025-01-09 16:42:28,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 121 transitions, 690 flow [2025-01-09 16:42:28,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2025-01-09 16:42:28,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45901639344262296 [2025-01-09 16:42:28,710 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 312 flow. Second operand 5 states and 140 transitions. [2025-01-09 16:42:28,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 121 transitions, 690 flow [2025-01-09 16:42:28,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 121 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:28,735 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 346 flow [2025-01-09 16:42:28,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-01-09 16:42:28,735 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2025-01-09 16:42:28,735 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 346 flow [2025-01-09 16:42:28,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:42:28,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:28,736 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:28,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:42:28,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:28,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash 68778404, now seen corresponding path program 4 times [2025-01-09 16:42:28,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:28,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011836378] [2025-01-09 16:42:28,737 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:42:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:28,743 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:42:28,745 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 42 statements. [2025-01-09 16:42:28,745 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:42:28,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:28,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:28,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011836378] [2025-01-09 16:42:28,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011836378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:28,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:28,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:28,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135579931] [2025-01-09 16:42:28,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:28,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:28,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:28,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:28,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:28,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:28,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:42:28,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:28,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:28,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:31,315 INFO L124 PetriNetUnfolderBase]: 33689/45522 cut-off events. [2025-01-09 16:42:31,316 INFO L125 PetriNetUnfolderBase]: For 36571/36575 co-relation queries the response was YES. [2025-01-09 16:42:31,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120638 conditions, 45522 events. 33689/45522 cut-off events. For 36571/36575 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 257801 event pairs, 8267 based on Foata normal form. 361/40379 useless extension candidates. Maximal degree in co-relation 120620. Up to 28662 conditions per place. [2025-01-09 16:42:31,517 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 129 selfloop transitions, 13 changer transitions 2/148 dead transitions. [2025-01-09 16:42:31,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 148 transitions, 894 flow [2025-01-09 16:42:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-01-09 16:42:31,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5049180327868853 [2025-01-09 16:42:31,519 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 346 flow. Second operand 5 states and 154 transitions. [2025-01-09 16:42:31,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 148 transitions, 894 flow [2025-01-09 16:42:31,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 148 transitions, 878 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:31,588 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 403 flow [2025-01-09 16:42:31,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-01-09 16:42:31,590 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2025-01-09 16:42:31,590 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 403 flow [2025-01-09 16:42:31,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:42:31,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:31,590 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:31,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:42:31,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:31,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash -840671894, now seen corresponding path program 5 times [2025-01-09 16:42:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075713039] [2025-01-09 16:42:31,592 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:42:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:31,608 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:42:31,613 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:42:31,613 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:31,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:31,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:31,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075713039] [2025-01-09 16:42:31,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075713039] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:31,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024575427] [2025-01-09 16:42:31,670 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:42:31,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:31,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:31,672 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:42:31,673 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:42:31,722 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 16:42:31,741 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:42:31,741 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:31,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:31,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 16:42:31,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:31,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024575427] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:32,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:42:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-01-09 16:42:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954110895] [2025-01-09 16:42:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:32,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:42:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:32,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:42:32,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:42:32,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:32,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:42:32,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:32,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:32,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:34,100 INFO L124 PetriNetUnfolderBase]: 31109/42000 cut-off events. [2025-01-09 16:42:34,100 INFO L125 PetriNetUnfolderBase]: For 50419/50419 co-relation queries the response was YES. [2025-01-09 16:42:34,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115951 conditions, 42000 events. 31109/42000 cut-off events. For 50419/50419 co-relation queries the response was YES. Maximal size of possible extension queue 1229. Compared 234210 event pairs, 15800 based on Foata normal form. 447/37232 useless extension candidates. Maximal degree in co-relation 115931. Up to 23129 conditions per place. [2025-01-09 16:42:34,337 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 98 selfloop transitions, 12 changer transitions 1/115 dead transitions. [2025-01-09 16:42:34,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 789 flow [2025-01-09 16:42:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:42:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:42:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-01-09 16:42:34,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3469945355191257 [2025-01-09 16:42:34,339 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 403 flow. Second operand 6 states and 127 transitions. [2025-01-09 16:42:34,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 789 flow [2025-01-09 16:42:34,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 115 transitions, 784 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:34,449 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 444 flow [2025-01-09 16:42:34,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2025-01-09 16:42:34,449 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 31 predicate places. [2025-01-09 16:42:34,450 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 444 flow [2025-01-09 16:42:34,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:42:34,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:34,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:34,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:42:34,655 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,SelfDestructingSolverStorable11 [2025-01-09 16:42:34,655 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:34,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash 283305771, now seen corresponding path program 1 times [2025-01-09 16:42:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:34,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043618772] [2025-01-09 16:42:34,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:34,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 16:42:34,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 16:42:34,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:34,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:35,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043618772] [2025-01-09 16:42:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043618772] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527324475] [2025-01-09 16:42:35,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:35,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:35,305 INFO L229 MonitoredProcess]: Starting monitored process 6 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:42:35,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:42:35,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 16:42:35,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 16:42:35,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:35,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:35,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:42:35,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:35,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 16:42:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:35,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:42:35,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527324475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:35,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:42:35,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2025-01-09 16:42:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402633856] [2025-01-09 16:42:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:35,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:42:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:35,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:42:35,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:42:35,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:35,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 444 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:35,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:35,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:35,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:39,777 INFO L124 PetriNetUnfolderBase]: 47285/63852 cut-off events. [2025-01-09 16:42:39,777 INFO L125 PetriNetUnfolderBase]: For 85967/85967 co-relation queries the response was YES. [2025-01-09 16:42:39,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180940 conditions, 63852 events. 47285/63852 cut-off events. For 85967/85967 co-relation queries the response was YES. Maximal size of possible extension queue 1529. Compared 373527 event pairs, 14770 based on Foata normal form. 1/56084 useless extension candidates. Maximal degree in co-relation 180919. Up to 21223 conditions per place. [2025-01-09 16:42:40,079 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 272 selfloop transitions, 30 changer transitions 3/309 dead transitions. [2025-01-09 16:42:40,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 309 transitions, 1931 flow [2025-01-09 16:42:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:42:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:42:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 344 transitions. [2025-01-09 16:42:40,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5639344262295082 [2025-01-09 16:42:40,081 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 444 flow. Second operand 10 states and 344 transitions. [2025-01-09 16:42:40,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 309 transitions, 1931 flow [2025-01-09 16:42:40,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 309 transitions, 1855 flow, removed 30 selfloop flow, removed 4 redundant places. [2025-01-09 16:42:40,315 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 616 flow [2025-01-09 16:42:40,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=616, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2025-01-09 16:42:40,316 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places. [2025-01-09 16:42:40,316 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 616 flow [2025-01-09 16:42:40,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:40,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:40,316 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:40,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:42:40,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 16:42:40,517 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:42:40,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:40,517 INFO L85 PathProgramCache]: Analyzing trace with hash 269201340, now seen corresponding path program 1 times [2025-01-09 16:42:40,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:40,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019191978] [2025-01-09 16:42:40,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:40,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:40,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 16:42:40,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 16:42:40,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:40,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019191978] [2025-01-09 16:42:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019191978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784738481] [2025-01-09 16:42:41,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:41,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:41,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:41,037 INFO L229 MonitoredProcess]: Starting monitored process 7 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:42:41,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:42:41,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 16:42:41,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 16:42:41,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:41,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:41,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:42:41,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:41,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 16:42:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:41,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:42:41,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784738481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:41,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:42:41,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2025-01-09 16:42:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288812706] [2025-01-09 16:42:41,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:41,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:42:41,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:41,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:42:41,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:42:41,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-01-09 16:42:41,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 616 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:41,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:41,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-01-09 16:42:41,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand