./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-5.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 103efe8931e099ca6c2446ad32c4c46818a6d213fc850bc42032bda38d601e6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:41:50,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:41:50,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:41:50,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:41:50,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:41:50,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:41:50,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:41:50,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:41:50,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:41:50,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:41:50,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:41:50,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:41:50,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:41:50,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:41:50,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:41:50,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:41:50,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:41:50,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:41:50,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:41:50,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:41:50,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:41:50,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:41:50,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:41:50,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:41:50,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:41:50,778 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 -> 103efe8931e099ca6c2446ad32c4c46818a6d213fc850bc42032bda38d601e6f [2025-01-09 16:41:50,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:41:50,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:41:50,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:41:50,978 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:41:50,978 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:41:50,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2025-01-09 16:41:52,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da832af03/65ba56ad5c0042bfa4cfbea8644b91f5/FLAG8e30bbbf7 [2025-01-09 16:41:52,308 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:41:52,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2025-01-09 16:41:52,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da832af03/65ba56ad5c0042bfa4cfbea8644b91f5/FLAG8e30bbbf7 [2025-01-09 16:41:52,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da832af03/65ba56ad5c0042bfa4cfbea8644b91f5 [2025-01-09 16:41:52,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:41:52,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:41:52,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:41:52,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:41:52,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:41:52,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a01903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52, skipping insertion in model container [2025-01-09 16:41:52,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:41:52,750 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-misc-5.wvr.c[3066,3079] [2025-01-09 16:41:52,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:41:52,761 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:41:52,778 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-misc-5.wvr.c[3066,3079] [2025-01-09 16:41:52,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:41:52,794 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:41:52,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52 WrapperNode [2025-01-09 16:41:52,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:41:52,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:41:52,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:41:52,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:41:52,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,831 INFO L138 Inliner]: procedures = 21, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-01-09 16:41:52,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:41:52,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:41:52,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:41:52,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:41:52,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,853 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:41:52,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:41:52,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:41:52,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:41:52,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:41:52,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (1/1) ... [2025-01-09 16:41:52,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:41:52,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:52,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:41:52,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:41:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:41:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:41:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:41:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:41:52,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:41:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:41:52,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:41:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:41:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:41:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:41:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:41:52,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:41:52,913 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:41:52,978 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:41:52,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:41:53,136 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:41:53,136 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:41:53,247 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:41:53,248 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:41:53,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:53 BoogieIcfgContainer [2025-01-09 16:41:53,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:41:53,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:41:53,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:41:53,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:41:53,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:41:52" (1/3) ... [2025-01-09 16:41:53,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e3d64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:53, skipping insertion in model container [2025-01-09 16:41:53,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:52" (2/3) ... [2025-01-09 16:41:53,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e3d64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:53, skipping insertion in model container [2025-01-09 16:41:53,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:53" (3/3) ... [2025-01-09 16:41:53,255 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2025-01-09 16:41:53,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:41:53,266 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-5.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 16:41:53,266 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:41:53,314 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:41:53,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 93 flow [2025-01-09 16:41:53,360 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-01-09 16:41:53,361 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:41:53,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 4/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-01-09 16:41:53,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 93 flow [2025-01-09 16:41:53,365 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 82 flow [2025-01-09 16:41:53,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:41:53,384 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;@6fe5ebec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:41:53,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:41:53,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:41:53,400 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-01-09 16:41:53,400 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:41:53,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:53,401 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] [2025-01-09 16:41:53,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:53,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:53,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2068423331, now seen corresponding path program 1 times [2025-01-09 16:41:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095932182] [2025-01-09 16:41:53,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:53,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:41:53,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:41:53,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:53,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:53,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:53,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095932182] [2025-01-09 16:41:53,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095932182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:53,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:53,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:41:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906184987] [2025-01-09 16:41:53,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:53,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:41:53,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:53,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:41:53,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:41:53,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-01-09 16:41:53,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:53,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:53,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-01-09 16:41:53,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:54,263 INFO L124 PetriNetUnfolderBase]: 1930/2760 cut-off events. [2025-01-09 16:41:54,263 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-01-09 16:41:54,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5645 conditions, 2760 events. 1930/2760 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 13539 event pairs, 66 based on Foata normal form. 0/2249 useless extension candidates. Maximal degree in co-relation 5542. Up to 970 conditions per place. [2025-01-09 16:41:54,276 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 71 selfloop transitions, 8 changer transitions 6/91 dead transitions. [2025-01-09 16:41:54,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 91 transitions, 385 flow [2025-01-09 16:41:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:41:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:41:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2025-01-09 16:41:54,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2025-01-09 16:41:54,288 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 82 flow. Second operand 6 states and 141 transitions. [2025-01-09 16:41:54,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 91 transitions, 385 flow [2025-01-09 16:41:54,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 91 transitions, 363 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:41:54,297 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 120 flow [2025-01-09 16:41:54,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-01-09 16:41:54,301 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2025-01-09 16:41:54,302 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 120 flow [2025-01-09 16:41:54,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:54,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:54,302 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] [2025-01-09 16:41:54,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:41:54,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:54,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 813005918, now seen corresponding path program 1 times [2025-01-09 16:41:54,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:54,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730380070] [2025-01-09 16:41:54,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:54,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:54,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:41:54,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:41:54,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:54,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:54,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:54,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730380070] [2025-01-09 16:41:54,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730380070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:54,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:54,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:41:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979939182] [2025-01-09 16:41:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:54,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:41:54,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:54,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:41:54,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:41:54,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:41:54,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:54,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:54,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:41:54,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:54,596 INFO L124 PetriNetUnfolderBase]: 1274/1985 cut-off events. [2025-01-09 16:41:54,596 INFO L125 PetriNetUnfolderBase]: For 513/547 co-relation queries the response was YES. [2025-01-09 16:41:54,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 1985 events. 1274/1985 cut-off events. For 513/547 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9818 event pairs, 424 based on Foata normal form. 86/1666 useless extension candidates. Maximal degree in co-relation 3922. Up to 1047 conditions per place. [2025-01-09 16:41:54,605 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 45 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-01-09 16:41:54,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 273 flow [2025-01-09 16:41:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:41:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:41:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-01-09 16:41:54,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2025-01-09 16:41:54,606 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 120 flow. Second operand 3 states and 80 transitions. [2025-01-09 16:41:54,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 273 flow [2025-01-09 16:41:54,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:41:54,608 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 134 flow [2025-01-09 16:41:54,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-01-09 16:41:54,608 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-01-09 16:41:54,608 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 134 flow [2025-01-09 16:41:54,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:54,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:54,609 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] [2025-01-09 16:41:54,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:41:54,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:54,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2013377881, now seen corresponding path program 1 times [2025-01-09 16:41:54,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:54,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787188470] [2025-01-09 16:41:54,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:54,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:54,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:41:54,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:41:54,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:54,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:54,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:54,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787188470] [2025-01-09 16:41:54,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787188470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:54,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:41:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909621861] [2025-01-09 16:41:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:54,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:41:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:54,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:41:54,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:41:54,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:41:54,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:54,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:54,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:41:54,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:54,886 INFO L124 PetriNetUnfolderBase]: 1715/2705 cut-off events. [2025-01-09 16:41:54,886 INFO L125 PetriNetUnfolderBase]: For 1009/1067 co-relation queries the response was YES. [2025-01-09 16:41:54,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6284 conditions, 2705 events. 1715/2705 cut-off events. For 1009/1067 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14139 event pairs, 587 based on Foata normal form. 114/2305 useless extension candidates. Maximal degree in co-relation 5840. Up to 1613 conditions per place. [2025-01-09 16:41:54,897 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 44 selfloop transitions, 2 changer transitions 1/59 dead transitions. [2025-01-09 16:41:54,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 291 flow [2025-01-09 16:41:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:41:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:41:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-01-09 16:41:54,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-01-09 16:41:54,898 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 134 flow. Second operand 3 states and 78 transitions. [2025-01-09 16:41:54,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 291 flow [2025-01-09 16:41:54,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:41:54,900 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2025-01-09 16:41:54,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-01-09 16:41:54,901 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-01-09 16:41:54,901 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2025-01-09 16:41:54,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:54,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:54,902 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] [2025-01-09 16:41:54,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:41:54,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:54,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash 284683765, now seen corresponding path program 1 times [2025-01-09 16:41:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367406316] [2025-01-09 16:41:54,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:54,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:41:54,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:41:54,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367406316] [2025-01-09 16:41:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367406316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:55,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:55,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:41:55,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349952910] [2025-01-09 16:41:55,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:55,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:41:55,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:55,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:41:55,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:41:55,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-01-09 16:41:55,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:55,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:55,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-01-09 16:41:55,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:55,231 INFO L124 PetriNetUnfolderBase]: 2217/3273 cut-off events. [2025-01-09 16:41:55,231 INFO L125 PetriNetUnfolderBase]: For 1605/1649 co-relation queries the response was YES. [2025-01-09 16:41:55,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8230 conditions, 3273 events. 2217/3273 cut-off events. For 1605/1649 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14637 event pairs, 156 based on Foata normal form. 44/2841 useless extension candidates. Maximal degree in co-relation 7532. Up to 1635 conditions per place. [2025-01-09 16:41:55,242 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 53 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2025-01-09 16:41:55,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 353 flow [2025-01-09 16:41:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:41:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:41:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-01-09 16:41:55,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2025-01-09 16:41:55,243 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 4 states and 85 transitions. [2025-01-09 16:41:55,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 353 flow [2025-01-09 16:41:55,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:41:55,246 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 173 flow [2025-01-09 16:41:55,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-01-09 16:41:55,246 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-01-09 16:41:55,246 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 173 flow [2025-01-09 16:41:55,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:55,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:55,246 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] [2025-01-09 16:41:55,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:41:55,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:55,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1582963133, now seen corresponding path program 2 times [2025-01-09 16:41:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:55,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189415384] [2025-01-09 16:41:55,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:41:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:55,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:41:55,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:41:55,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:41:55,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:55,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:55,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189415384] [2025-01-09 16:41:55,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189415384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:55,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:55,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:41:55,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206463281] [2025-01-09 16:41:55,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:55,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:41:55,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:55,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:41:55,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:41:55,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-01-09 16:41:55,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:55,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:55,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-01-09 16:41:55,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:55,639 INFO L124 PetriNetUnfolderBase]: 2923/4307 cut-off events. [2025-01-09 16:41:55,639 INFO L125 PetriNetUnfolderBase]: For 2599/2643 co-relation queries the response was YES. [2025-01-09 16:41:55,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11133 conditions, 4307 events. 2923/4307 cut-off events. For 2599/2643 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 20457 event pairs, 374 based on Foata normal form. 114/3889 useless extension candidates. Maximal degree in co-relation 10084. Up to 1635 conditions per place. [2025-01-09 16:41:55,653 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 69 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-01-09 16:41:55,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 461 flow [2025-01-09 16:41:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:41:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:41:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-01-09 16:41:55,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6055555555555555 [2025-01-09 16:41:55,654 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 173 flow. Second operand 5 states and 109 transitions. [2025-01-09 16:41:55,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 461 flow [2025-01-09 16:41:55,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:41:55,658 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 190 flow [2025-01-09 16:41:55,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-01-09 16:41:55,658 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-01-09 16:41:55,658 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 190 flow [2025-01-09 16:41:55,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:55,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:55,659 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] [2025-01-09 16:41:55,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:41:55,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:55,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash -402070699, now seen corresponding path program 3 times [2025-01-09 16:41:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:55,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67874911] [2025-01-09 16:41:55,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:41:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:55,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:41:55,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:41:55,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:41:55,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:55,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:55,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67874911] [2025-01-09 16:41:55,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67874911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:55,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:55,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:41:55,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816846870] [2025-01-09 16:41:55,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:55,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:41:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:55,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:41:55,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:41:55,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-01-09 16:41:55,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:55,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:55,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-01-09 16:41:55,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:56,673 INFO L124 PetriNetUnfolderBase]: 9337/13735 cut-off events. [2025-01-09 16:41:56,673 INFO L125 PetriNetUnfolderBase]: For 11326/11423 co-relation queries the response was YES. [2025-01-09 16:41:56,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35322 conditions, 13735 events. 9337/13735 cut-off events. For 11326/11423 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 81309 event pairs, 1762 based on Foata normal form. 545/12519 useless extension candidates. Maximal degree in co-relation 29843. Up to 3436 conditions per place. [2025-01-09 16:41:56,714 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 106 selfloop transitions, 25 changer transitions 21/160 dead transitions. [2025-01-09 16:41:56,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 160 transitions, 922 flow [2025-01-09 16:41:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:41:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:41:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2025-01-09 16:41:56,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6635802469135802 [2025-01-09 16:41:56,715 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 190 flow. Second operand 9 states and 215 transitions. [2025-01-09 16:41:56,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 160 transitions, 922 flow [2025-01-09 16:41:56,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 160 transitions, 905 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:41:56,721 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 404 flow [2025-01-09 16:41:56,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=404, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-01-09 16:41:56,722 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2025-01-09 16:41:56,722 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 404 flow [2025-01-09 16:41:56,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:56,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:56,722 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:41:56,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 631402658, now seen corresponding path program 4 times [2025-01-09 16:41:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598972621] [2025-01-09 16:41:56,723 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:41:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:56,728 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:41:56,812 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:41:56,812 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:41:56,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:41:56,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:56,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598972621] [2025-01-09 16:41:56,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598972621] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:41:56,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185650221] [2025-01-09 16:41:56,858 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:41:56,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:56,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:56,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:41:56,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:41:56,900 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-01-09 16:41:56,915 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:41:56,915 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:41:56,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:56,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:41:56,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:41:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:56,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:41:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:41:56,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185650221] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:41:56,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:41:56,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-01-09 16:41:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305616994] [2025-01-09 16:41:56,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:41:56,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:41:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:56,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:41:56,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:41:56,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:41:56,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 404 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:56,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:56,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:41:56,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:57,698 INFO L124 PetriNetUnfolderBase]: 7446/11469 cut-off events. [2025-01-09 16:41:57,699 INFO L125 PetriNetUnfolderBase]: For 27551/27783 co-relation queries the response was YES. [2025-01-09 16:41:57,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35298 conditions, 11469 events. 7446/11469 cut-off events. For 27551/27783 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 69599 event pairs, 3245 based on Foata normal form. 286/9980 useless extension candidates. Maximal degree in co-relation 31954. Up to 4224 conditions per place. [2025-01-09 16:41:57,757 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 85 selfloop transitions, 11 changer transitions 0/115 dead transitions. [2025-01-09 16:41:57,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 928 flow [2025-01-09 16:41:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:41:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:41:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-01-09 16:41:57,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7847222222222222 [2025-01-09 16:41:57,760 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 404 flow. Second operand 4 states and 113 transitions. [2025-01-09 16:41:57,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 928 flow [2025-01-09 16:41:57,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 115 transitions, 880 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-01-09 16:41:57,785 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 501 flow [2025-01-09 16:41:57,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=501, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2025-01-09 16:41:57,785 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2025-01-09 16:41:57,785 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 501 flow [2025-01-09 16:41:57,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:57,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:57,785 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:57,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:41:57,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:57,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:57,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1739963535, now seen corresponding path program 1 times [2025-01-09 16:41:57,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:57,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137065295] [2025-01-09 16:41:57,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:57,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:41:57,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:41:57,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:57,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:41:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137065295] [2025-01-09 16:41:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137065295] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:41:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497290103] [2025-01-09 16:41:58,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:58,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:58,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:58,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:41:58,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:41:58,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:41:58,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:41:58,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:58,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:58,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:41:58,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:41:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:58,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:41:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:41:58,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497290103] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:41:58,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:41:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-01-09 16:41:58,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216014434] [2025-01-09 16:41:58,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:41:58,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:41:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:58,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:41:58,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:41:58,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:41:58,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 501 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:58,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:58,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:41:58,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:59,340 INFO L124 PetriNetUnfolderBase]: 15608/24117 cut-off events. [2025-01-09 16:41:59,340 INFO L125 PetriNetUnfolderBase]: For 66594/66954 co-relation queries the response was YES. [2025-01-09 16:41:59,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75807 conditions, 24117 events. 15608/24117 cut-off events. For 66594/66954 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 164826 event pairs, 6335 based on Foata normal form. 540/21046 useless extension candidates. Maximal degree in co-relation 67649. Up to 8557 conditions per place. [2025-01-09 16:41:59,445 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 102 selfloop transitions, 15 changer transitions 0/136 dead transitions. [2025-01-09 16:41:59,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 136 transitions, 1276 flow [2025-01-09 16:41:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:41:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:41:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-01-09 16:41:59,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-01-09 16:41:59,446 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 501 flow. Second operand 4 states and 109 transitions. [2025-01-09 16:41:59,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 136 transitions, 1276 flow [2025-01-09 16:41:59,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 136 transitions, 1244 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-01-09 16:41:59,471 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 679 flow [2025-01-09 16:41:59,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=679, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2025-01-09 16:41:59,472 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2025-01-09 16:41:59,472 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 679 flow [2025-01-09 16:41:59,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:59,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:59,472 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:59,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:41:59,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:59,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:59,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash 813174219, now seen corresponding path program 5 times [2025-01-09 16:41:59,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:59,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114118333] [2025-01-09 16:41:59,673 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:41:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:59,680 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-01-09 16:41:59,695 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:41:59,696 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:41:59,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:59,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114118333] [2025-01-09 16:41:59,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114118333] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:41:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186141838] [2025-01-09 16:41:59,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:41:59,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:59,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:59,851 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:41:59,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:41:59,885 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-01-09 16:41:59,902 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:41:59,902 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:41:59,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:59,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 16:41:59,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:00,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:00,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186141838] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:00,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:00,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 20 [2025-01-09 16:42:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176019122] [2025-01-09 16:42:00,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:00,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 16:42:00,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:00,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 16:42:00,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:42:00,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-01-09 16:42:00,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 679 flow. Second operand has 21 states, 21 states have (on average 12.333333333333334) internal successors, (259), 21 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:00,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:00,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-01-09 16:42:00,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:07,646 INFO L124 PetriNetUnfolderBase]: 71280/106074 cut-off events. [2025-01-09 16:42:07,646 INFO L125 PetriNetUnfolderBase]: For 366124/366756 co-relation queries the response was YES. [2025-01-09 16:42:08,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353855 conditions, 106074 events. 71280/106074 cut-off events. For 366124/366756 co-relation queries the response was YES. Maximal size of possible extension queue 2909. Compared 780731 event pairs, 7531 based on Foata normal form. 1465/94944 useless extension candidates. Maximal degree in co-relation 332903. Up to 21741 conditions per place. [2025-01-09 16:42:08,263 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 404 selfloop transitions, 255 changer transitions 36/703 dead transitions. [2025-01-09 16:42:08,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 703 transitions, 6646 flow [2025-01-09 16:42:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 16:42:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-01-09 16:42:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 798 transitions. [2025-01-09 16:42:08,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6157407407407407 [2025-01-09 16:42:08,267 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 679 flow. Second operand 36 states and 798 transitions. [2025-01-09 16:42:08,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 703 transitions, 6646 flow [2025-01-09 16:42:08,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 703 transitions, 6394 flow, removed 126 selfloop flow, removed 0 redundant places. [2025-01-09 16:42:08,444 INFO L231 Difference]: Finished difference. Result has 118 places, 379 transitions, 4936 flow [2025-01-09 16:42:08,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4936, PETRI_PLACES=118, PETRI_TRANSITIONS=379} [2025-01-09 16:42:08,444 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 80 predicate places. [2025-01-09 16:42:08,444 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 379 transitions, 4936 flow [2025-01-09 16:42:08,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.333333333333334) internal successors, (259), 21 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:08,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:08,445 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:08,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:42:08,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:08,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:08,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash 720025930, now seen corresponding path program 6 times [2025-01-09 16:42:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:08,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902112472] [2025-01-09 16:42:08,646 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:42:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:08,655 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 4 equivalence classes. [2025-01-09 16:42:08,685 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:08,685 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-09 16:42:08,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:42:08,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902112472] [2025-01-09 16:42:08,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902112472] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781370789] [2025-01-09 16:42:08,800 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:42:08,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:08,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:08,804 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:08,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:42:08,837 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 4 equivalence classes. [2025-01-09 16:42:08,855 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:08,855 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-09 16:42:08,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:08,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:42:08,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:08,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:42:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781370789] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:08,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:08,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-01-09 16:42:08,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614139776] [2025-01-09 16:42:08,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:08,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:42:08,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:08,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:42:08,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:42:08,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:42:08,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 379 transitions, 4936 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:08,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:08,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:42:08,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:20,531 INFO L124 PetriNetUnfolderBase]: 79950/123983 cut-off events. [2025-01-09 16:42:20,532 INFO L125 PetriNetUnfolderBase]: For 703457/705555 co-relation queries the response was YES. [2025-01-09 16:42:21,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483207 conditions, 123983 events. 79950/123983 cut-off events. For 703457/705555 co-relation queries the response was YES. Maximal size of possible extension queue 3194. Compared 999769 event pairs, 30396 based on Foata normal form. 1838/110794 useless extension candidates. Maximal degree in co-relation 467083. Up to 32591 conditions per place. [2025-01-09 16:42:21,671 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 759 selfloop transitions, 155 changer transitions 0/953 dead transitions. [2025-01-09 16:42:21,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 953 transitions, 14603 flow [2025-01-09 16:42:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-01-09 16:42:21,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2025-01-09 16:42:21,673 INFO L175 Difference]: Start difference. First operand has 118 places, 379 transitions, 4936 flow. Second operand 5 states and 146 transitions. [2025-01-09 16:42:21,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 953 transitions, 14603 flow [2025-01-09 16:42:26,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 953 transitions, 10264 flow, removed 2125 selfloop flow, removed 8 redundant places. [2025-01-09 16:42:26,290 INFO L231 Difference]: Finished difference. Result has 115 places, 462 transitions, 4668 flow [2025-01-09 16:42:26,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3418, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4668, PETRI_PLACES=115, PETRI_TRANSITIONS=462} [2025-01-09 16:42:26,290 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2025-01-09 16:42:26,290 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 462 transitions, 4668 flow [2025-01-09 16:42:26,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:26,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:26,291 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:26,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:42:26,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:42:26,492 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:26,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:26,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1142231001, now seen corresponding path program 2 times [2025-01-09 16:42:26,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:26,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878973318] [2025-01-09 16:42:26,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:26,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:26,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-01-09 16:42:26,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:26,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:26,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:42:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878973318] [2025-01-09 16:42:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878973318] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215734270] [2025-01-09 16:42:26,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:26,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:26,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:26,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:42:26,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-01-09 16:42:26,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:26,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:26,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:26,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:42:26,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:26,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:42:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215734270] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:26,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:26,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-01-09 16:42:26,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910141414] [2025-01-09 16:42:26,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:26,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:42:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:26,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:42:26,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:42:26,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-01-09 16:42:26,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 462 transitions, 4668 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:26,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:26,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-01-09 16:42:26,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand