./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-1.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 b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:36:57,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:36:57,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:36:57,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:36:57,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:36:57,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:36:57,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:36:57,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:36:57,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:36:57,544 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:36:57,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:36:57,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:36:57,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:36:57,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:36:57,545 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:36:57,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:36:57,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:36:57,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:36:57,547 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:36:57,547 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:36:57,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:36:57,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:36:57,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:36:57,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:36:57,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:36:57,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:36:57,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:36:57,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:36:57,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:36:57,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:36:57,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:36:57,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:36:57,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:36:57,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:36:57,548 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 -> b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 [2025-02-06 04:36:57,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:36:57,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:36:57,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:36:57,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:36:57,804 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:36:57,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-02-06 04:36:58,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e12f6119c/c624ad94a1a949829030aabf8fe87e8d/FLAG9ae3ac6e9 [2025-02-06 04:36:59,201 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:36:59,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-02-06 04:36:59,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e12f6119c/c624ad94a1a949829030aabf8fe87e8d/FLAG9ae3ac6e9 [2025-02-06 04:36:59,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e12f6119c/c624ad94a1a949829030aabf8fe87e8d [2025-02-06 04:36:59,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:36:59,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:36:59,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:36:59,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:36:59,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:36:59,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59, skipping insertion in model container [2025-02-06 04:36:59,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:36:59,676 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-1.wvr.c[3694,3707] [2025-02-06 04:36:59,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:36:59,691 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:36:59,705 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-1.wvr.c[3694,3707] [2025-02-06 04:36:59,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:36:59,722 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:36:59,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59 WrapperNode [2025-02-06 04:36:59,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:36:59,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:36:59,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:36:59,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:36:59,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,762 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 288 [2025-02-06 04:36:59,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:36:59,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:36:59,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:36:59,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:36:59,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,801 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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-02-06 04:36:59,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:36:59,824 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:36:59,824 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:36:59,824 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:36:59,825 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (1/1) ... [2025-02-06 04:36:59,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:36:59,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:59,851 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-02-06 04:36:59,854 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-02-06 04:36:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:36:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:36:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:36:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:36:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:36:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:36:59,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:36:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:36:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:36:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:36:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:36:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 04:36:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 04:36:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:36:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:36:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:36:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:36:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:36:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:36:59,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:36:59,875 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:36:59,973 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:36:59,975 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:37:00,334 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:37:00,335 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:37:00,582 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:37:00,583 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:37:00,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:37:00 BoogieIcfgContainer [2025-02-06 04:37:00,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:37:00,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:37:00,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:37:00,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:37:00,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:36:59" (1/3) ... [2025-02-06 04:37:00,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efb8761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:37:00, skipping insertion in model container [2025-02-06 04:37:00,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:59" (2/3) ... [2025-02-06 04:37:00,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efb8761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:37:00, skipping insertion in model container [2025-02-06 04:37:00,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:37:00" (3/3) ... [2025-02-06 04:37:00,590 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-02-06 04:37:00,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:37:00,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 46 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-06 04:37:00,603 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:37:00,659 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 04:37:00,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 136 flow [2025-02-06 04:37:00,718 INFO L124 PetriNetUnfolderBase]: 9/50 cut-off events. [2025-02-06 04:37:00,720 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:37:00,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 50 events. 9/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-06 04:37:00,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 54 transitions, 136 flow [2025-02-06 04:37:00,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 49 transitions, 122 flow [2025-02-06 04:37:00,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:37:00,747 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;@5436764b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:37:00,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:37:00,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:37:00,767 INFO L124 PetriNetUnfolderBase]: 9/48 cut-off events. [2025-02-06 04:37:00,767 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:37:00,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:00,768 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] [2025-02-06 04:37:00,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:37:00,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2112541286, now seen corresponding path program 1 times [2025-02-06 04:37:00,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:00,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108349759] [2025-02-06 04:37:00,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:00,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:00,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:37:00,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:37:00,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:00,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:00,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:00,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108349759] [2025-02-06 04:37:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108349759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:37:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:37:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:37:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253767158] [2025-02-06 04:37:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:00,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:37:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:00,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:37:00,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:37:00,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-02-06 04:37:00,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 122 flow. Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-02-06 04:37:00,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:00,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-02-06 04:37:00,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:02,719 INFO L124 PetriNetUnfolderBase]: 19797/25801 cut-off events. [2025-02-06 04:37:02,720 INFO L125 PetriNetUnfolderBase]: For 1319/1319 co-relation queries the response was YES. [2025-02-06 04:37:02,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52712 conditions, 25801 events. 19797/25801 cut-off events. For 1319/1319 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 129722 event pairs, 16578 based on Foata normal form. 0/22450 useless extension candidates. Maximal degree in co-relation 49225. Up to 25706 conditions per place. [2025-02-06 04:37:02,943 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 40 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2025-02-06 04:37:02,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 194 flow [2025-02-06 04:37:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:37:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 04:37:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2025-02-06 04:37:02,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-02-06 04:37:02,954 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 122 flow. Second operand 2 states and 62 transitions. [2025-02-06 04:37:02,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 194 flow [2025-02-06 04:37:02,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 178 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 04:37:02,999 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 98 flow [2025-02-06 04:37:03,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-02-06 04:37:03,004 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2025-02-06 04:37:03,004 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 98 flow [2025-02-06 04:37:03,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-02-06 04:37:03,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:03,005 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] [2025-02-06 04:37:03,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:37:03,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:37:03,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:03,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1585036308, now seen corresponding path program 1 times [2025-02-06 04:37:03,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:03,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397224776] [2025-02-06 04:37:03,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:03,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:37:03,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:37:03,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:03,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397224776] [2025-02-06 04:37:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397224776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:37:03,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:37:03,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:37:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844659475] [2025-02-06 04:37:03,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:03,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:37:03,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:03,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:37:03,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:37:03,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-02-06 04:37:03,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-06 04:37:03,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:03,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-02-06 04:37:03,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:05,089 INFO L124 PetriNetUnfolderBase]: 31442/40888 cut-off events. [2025-02-06 04:37:05,090 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2025-02-06 04:37:05,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82350 conditions, 40888 events. 31442/40888 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 223111 event pairs, 9215 based on Foata normal form. 1/35408 useless extension candidates. Maximal degree in co-relation 82347. Up to 28277 conditions per place. [2025-02-06 04:37:05,215 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 69 selfloop transitions, 5 changer transitions 1/80 dead transitions. [2025-02-06 04:37:05,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 325 flow [2025-02-06 04:37:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:37:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:37:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-02-06 04:37:05,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2025-02-06 04:37:05,218 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 98 flow. Second operand 3 states and 103 transitions. [2025-02-06 04:37:05,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 325 flow [2025-02-06 04:37:05,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 325 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:37:05,221 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 131 flow [2025-02-06 04:37:05,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-02-06 04:37:05,221 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2025-02-06 04:37:05,222 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 131 flow [2025-02-06 04:37:05,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-06 04:37:05,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:05,222 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] [2025-02-06 04:37:05,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:37:05,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:37:05,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash 909691467, now seen corresponding path program 1 times [2025-02-06 04:37:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:05,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-02-06 04:37:05,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:05,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 04:37:05,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 04:37:05,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:05,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:05,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:05,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-02-06 04:37:05,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648740649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:37:05,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:37:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:37:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295212719] [2025-02-06 04:37:05,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:05,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:37:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:05,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:37:05,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:37:05,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-02-06 04:37:05,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:05,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:05,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-02-06 04:37:05,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:07,862 INFO L124 PetriNetUnfolderBase]: 47144/62036 cut-off events. [2025-02-06 04:37:07,863 INFO L125 PetriNetUnfolderBase]: For 4577/4577 co-relation queries the response was YES. [2025-02-06 04:37:07,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134514 conditions, 62036 events. 47144/62036 cut-off events. For 4577/4577 co-relation queries the response was YES. Maximal size of possible extension queue 2226. Compared 357554 event pairs, 39870 based on Foata normal form. 2027/55107 useless extension candidates. Maximal degree in co-relation 134509. Up to 40409 conditions per place. [2025-02-06 04:37:08,053 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 43 selfloop transitions, 2 changer transitions 35/85 dead transitions. [2025-02-06 04:37:08,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 384 flow [2025-02-06 04:37:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:37:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:37:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-02-06 04:37:08,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2025-02-06 04:37:08,054 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 131 flow. Second operand 4 states and 113 transitions. [2025-02-06 04:37:08,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 85 transitions, 384 flow [2025-02-06 04:37:08,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:37:08,058 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 144 flow [2025-02-06 04:37:08,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-02-06 04:37:08,059 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2025-02-06 04:37:08,060 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 144 flow [2025-02-06 04:37:08,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:08,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:08,060 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] [2025-02-06 04:37:08,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:37:08,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:37:08,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:08,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1492177388, now seen corresponding path program 1 times [2025-02-06 04:37:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:08,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786358373] [2025-02-06 04:37:08,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:08,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:08,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:37:08,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:37:08,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:08,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:08,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786358373] [2025-02-06 04:37:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786358373] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19380805] [2025-02-06 04:37:08,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:08,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:08,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:08,217 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-02-06 04:37:08,218 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-02-06 04:37:08,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:37:08,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:37:08,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:08,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:08,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 04:37:08,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:08,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:08,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19380805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:37:08,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:37:08,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 04:37:08,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839109674] [2025-02-06 04:37:08,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:37:08,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:37:08,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:08,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:37:08,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:37:08,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-02-06 04:37:08,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 144 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 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-02-06 04:37:08,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:08,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-02-06 04:37:08,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:11,165 INFO L124 PetriNetUnfolderBase]: 47144/62039 cut-off events. [2025-02-06 04:37:11,166 INFO L125 PetriNetUnfolderBase]: For 9186/9186 co-relation queries the response was YES. [2025-02-06 04:37:11,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134410 conditions, 62039 events. 47144/62039 cut-off events. For 9186/9186 co-relation queries the response was YES. Maximal size of possible extension queue 2226. Compared 357542 event pairs, 39870 based on Foata normal form. 2026/55109 useless extension candidates. Maximal degree in co-relation 134403. Up to 40408 conditions per place. [2025-02-06 04:37:11,395 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 75 selfloop transitions, 5 changer transitions 2/87 dead transitions. [2025-02-06 04:37:11,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 408 flow [2025-02-06 04:37:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:37:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:37:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-02-06 04:37:11,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-02-06 04:37:11,397 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 144 flow. Second operand 6 states and 132 transitions. [2025-02-06 04:37:11,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 408 flow [2025-02-06 04:37:11,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 400 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 04:37:11,407 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 179 flow [2025-02-06 04:37:11,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-02-06 04:37:11,408 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-02-06 04:37:11,408 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 179 flow [2025-02-06 04:37:11,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 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-02-06 04:37:11,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:11,409 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] [2025-02-06 04:37:11,416 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-02-06 04:37:11,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:11,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:37:11,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:11,613 INFO L85 PathProgramCache]: Analyzing trace with hash -375526714, now seen corresponding path program 1 times [2025-02-06 04:37:11,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:11,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381427620] [2025-02-06 04:37:11,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:11,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:37:11,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:37:11,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:11,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:11,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:11,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381427620] [2025-02-06 04:37:11,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381427620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:11,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897805888] [2025-02-06 04:37:11,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:11,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:11,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:11,738 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-02-06 04:37:11,740 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-02-06 04:37:11,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:37:11,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:37:11,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:11,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:11,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 04:37:11,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:11,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:11,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897805888] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:37:11,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:37:11,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 04:37:11,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448999253] [2025-02-06 04:37:11,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:37:11,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:37:11,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:11,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:37:11,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:37:11,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-02-06 04:37:11,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 179 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:11,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:11,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-02-06 04:37:11,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:14,078 INFO L124 PetriNetUnfolderBase]: 35526/46756 cut-off events. [2025-02-06 04:37:14,078 INFO L125 PetriNetUnfolderBase]: For 11625/11625 co-relation queries the response was YES. [2025-02-06 04:37:14,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104813 conditions, 46756 events. 35526/46756 cut-off events. For 11625/11625 co-relation queries the response was YES. Maximal size of possible extension queue 1639. Compared 259931 event pairs, 29704 based on Foata normal form. 611/40737 useless extension candidates. Maximal degree in co-relation 104804. Up to 40408 conditions per place. [2025-02-06 04:37:14,251 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 42 selfloop transitions, 4 changer transitions 29/80 dead transitions. [2025-02-06 04:37:14,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 387 flow [2025-02-06 04:37:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:37:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:37:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-02-06 04:37:14,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39197530864197533 [2025-02-06 04:37:14,252 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 179 flow. Second operand 6 states and 127 transitions. [2025-02-06 04:37:14,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 387 flow [2025-02-06 04:37:14,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 372 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 04:37:14,260 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 162 flow [2025-02-06 04:37:14,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2025-02-06 04:37:14,261 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-02-06 04:37:14,261 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 162 flow [2025-02-06 04:37:14,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:14,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:14,261 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] [2025-02-06 04:37:14,268 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-02-06 04:37:14,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:14,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:37:14,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash 485648829, now seen corresponding path program 2 times [2025-02-06 04:37:14,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:14,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992250091] [2025-02-06 04:37:14,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:37:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:14,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-06 04:37:14,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 38 statements. [2025-02-06 04:37:14,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:37:14,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:37:14,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:14,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992250091] [2025-02-06 04:37:14,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992250091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:37:14,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:37:14,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:37:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405477671] [2025-02-06 04:37:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:14,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:37:14,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:14,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:37:14,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:37:14,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-02-06 04:37:14,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-02-06 04:37:14,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:14,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-02-06 04:37:14,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:18,695 INFO L124 PetriNetUnfolderBase]: 70326/91180 cut-off events. [2025-02-06 04:37:18,695 INFO L125 PetriNetUnfolderBase]: For 15324/15324 co-relation queries the response was YES. [2025-02-06 04:37:18,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207356 conditions, 91180 events. 70326/91180 cut-off events. For 15324/15324 co-relation queries the response was YES. Maximal size of possible extension queue 3006. Compared 532476 event pairs, 19930 based on Foata normal form. 1/79427 useless extension candidates. Maximal degree in co-relation 207346. Up to 31389 conditions per place. [2025-02-06 04:37:19,071 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 112 selfloop transitions, 8 changer transitions 1/126 dead transitions. [2025-02-06 04:37:19,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 126 transitions, 620 flow [2025-02-06 04:37:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:37:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:37:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-02-06 04:37:19,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 04:37:19,072 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 162 flow. Second operand 4 states and 144 transitions. [2025-02-06 04:37:19,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 126 transitions, 620 flow [2025-02-06 04:37:19,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 126 transitions, 608 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:37:19,079 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 226 flow [2025-02-06 04:37:19,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-02-06 04:37:19,079 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-02-06 04:37:19,079 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 226 flow [2025-02-06 04:37:19,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-02-06 04:37:19,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:19,080 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] [2025-02-06 04:37:19,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:37:19,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:37:19,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash -489155051, now seen corresponding path program 2 times [2025-02-06 04:37:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:19,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705803762] [2025-02-06 04:37:19,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:37:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:19,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-06 04:37:19,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 38 statements. [2025-02-06 04:37:19,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:37:19,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:37:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:19,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705803762] [2025-02-06 04:37:19,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705803762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:37:19,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:37:19,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:37:19,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694452761] [2025-02-06 04:37:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:19,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:37:19,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:19,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:37:19,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:37:19,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-02-06 04:37:19,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-02-06 04:37:19,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:19,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-02-06 04:37:19,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:23,796 INFO L124 PetriNetUnfolderBase]: 80077/103819 cut-off events. [2025-02-06 04:37:23,796 INFO L125 PetriNetUnfolderBase]: For 52161/52161 co-relation queries the response was YES. [2025-02-06 04:37:24,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255363 conditions, 103819 events. 80077/103819 cut-off events. For 52161/52161 co-relation queries the response was YES. Maximal size of possible extension queue 3427. Compared 606753 event pairs, 14966 based on Foata normal form. 1/90133 useless extension candidates. Maximal degree in co-relation 255352. Up to 82350 conditions per place. [2025-02-06 04:37:24,268 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 100 selfloop transitions, 9 changer transitions 6/120 dead transitions. [2025-02-06 04:37:24,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 120 transitions, 640 flow [2025-02-06 04:37:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:37:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:37:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-02-06 04:37:24,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342592592592593 [2025-02-06 04:37:24,269 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 226 flow. Second operand 4 states and 137 transitions. [2025-02-06 04:37:24,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 120 transitions, 640 flow [2025-02-06 04:37:25,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 604 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-02-06 04:37:25,158 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 279 flow [2025-02-06 04:37:25,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2025-02-06 04:37:25,158 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-02-06 04:37:25,158 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 279 flow [2025-02-06 04:37:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-02-06 04:37:25,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:25,159 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] [2025-02-06 04:37:25,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:37:25,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:37:25,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash 116595988, now seen corresponding path program 1 times [2025-02-06 04:37:25,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:25,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791620718] [2025-02-06 04:37:25,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:25,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 04:37:25,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:37:25,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:25,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:25,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791620718] [2025-02-06 04:37:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791620718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:25,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032784114] [2025-02-06 04:37:25,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:25,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:25,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:25,970 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-02-06 04:37:25,971 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-02-06 04:37:26,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 04:37:26,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:37:26,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:26,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:26,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 04:37:26,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:26,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:37:26,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-02-06 04:37:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:26,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:37:26,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032784114] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:26,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:37:26,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 23 [2025-02-06 04:37:26,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888075454] [2025-02-06 04:37:26,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:26,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:37:26,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:26,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:37:26,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-02-06 04:37:26,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-02-06 04:37:26,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:26,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:26,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-02-06 04:37:26,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:32,983 INFO L124 PetriNetUnfolderBase]: 100611/130498 cut-off events. [2025-02-06 04:37:32,984 INFO L125 PetriNetUnfolderBase]: For 61831/61831 co-relation queries the response was YES. [2025-02-06 04:37:33,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319017 conditions, 130498 events. 100611/130498 cut-off events. For 61831/61831 co-relation queries the response was YES. Maximal size of possible extension queue 4478. Compared 784624 event pairs, 10428 based on Foata normal form. 1/112496 useless extension candidates. Maximal degree in co-relation 319005. Up to 95874 conditions per place. [2025-02-06 04:37:33,481 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 199 selfloop transitions, 43 changer transitions 8/255 dead transitions. [2025-02-06 04:37:33,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 255 transitions, 1328 flow [2025-02-06 04:37:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:37:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:37:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 322 transitions. [2025-02-06 04:37:33,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5962962962962963 [2025-02-06 04:37:33,482 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 279 flow. Second operand 10 states and 322 transitions. [2025-02-06 04:37:33,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 255 transitions, 1328 flow [2025-02-06 04:37:34,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 255 transitions, 1316 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-06 04:37:34,137 INFO L231 Difference]: Finished difference. Result has 77 places, 100 transitions, 622 flow [2025-02-06 04:37:34,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=622, PETRI_PLACES=77, PETRI_TRANSITIONS=100} [2025-02-06 04:37:34,138 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2025-02-06 04:37:34,138 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 100 transitions, 622 flow [2025-02-06 04:37:34,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:34,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:34,138 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] [2025-02-06 04:37:34,143 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-02-06 04:37:34,339 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-02-06 04:37:34,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:37:34,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:34,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1071476236, now seen corresponding path program 1 times [2025-02-06 04:37:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:34,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895793174] [2025-02-06 04:37:34,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:34,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 04:37:34,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:37:34,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:34,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895793174] [2025-02-06 04:37:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895793174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83286279] [2025-02-06 04:37:34,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:34,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:34,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:34,936 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-02-06 04:37:34,937 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-02-06 04:37:34,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 04:37:35,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:37:35,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:35,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:35,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 04:37:35,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:35,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:37:35,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-02-06 04:37:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:35,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:37:35,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83286279] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:35,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:37:35,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 23 [2025-02-06 04:37:35,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190805429] [2025-02-06 04:37:35,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:35,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:37:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:35,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:37:35,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-02-06 04:37:35,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-02-06 04:37:35,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 100 transitions, 622 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:35,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:35,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-02-06 04:37:35,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand