./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:45:32,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:45:32,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:45:32,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:45:32,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:45:32,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:45:32,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:45:32,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:45:32,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:45:32,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:45:32,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:45:32,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:45:32,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:45:32,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:45:32,364 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:45:32,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:45:32,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:45:32,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:45:32,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:45:32,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:45:32,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:45:32,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:45:32,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:45:32,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:45:32,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:45:32,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:45:32,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:45:32,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:45:32,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:45:32,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:45:32,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:45:32,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:45:32,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 [2025-03-13 21:45:32,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:45:32,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:45:32,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:45:32,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:45:32,616 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:45:32,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-13 21:45:33,766 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc673b323/1907bca98f244e21b51311fcfca95efc/FLAGa97f2581e [2025-03-13 21:45:33,998 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:45:34,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-13 21:45:34,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc673b323/1907bca98f244e21b51311fcfca95efc/FLAGa97f2581e [2025-03-13 21:45:34,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc673b323/1907bca98f244e21b51311fcfca95efc [2025-03-13 21:45:34,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:45:34,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:45:34,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:45:34,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:45:34,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:45:34,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b32f2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34, skipping insertion in model container [2025-03-13 21:45:34,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:45:34,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-03-13 21:45:34,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:45:34,493 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:45:34,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-03-13 21:45:34,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:45:34,532 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:45:34,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34 WrapperNode [2025-03-13 21:45:34,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:45:34,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:45:34,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:45:34,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:45:34,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,572 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2025-03-13 21:45:34,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:45:34,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:45:34,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:45:34,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:45:34,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,598 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-13 21:45:34,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:45:34,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:45:34,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:45:34,617 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:45:34,618 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (1/1) ... [2025-03-13 21:45:34,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:45:34,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:34,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:45:34,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:45:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:45:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:45:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:45:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:45:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:45:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:45:34,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:45:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:45:34,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:45:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:45:34,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:45:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:45:34,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:45:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:45:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:45:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:45:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:45:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:45:34,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:45:34,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:45:34,670 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:45:34,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:45:34,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:45:35,107 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:45:35,107 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:45:35,107 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:45:35,370 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:45:35,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:45:35 BoogieIcfgContainer [2025-03-13 21:45:35,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:45:35,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:45:35,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:45:35,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:45:35,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:45:34" (1/3) ... [2025-03-13 21:45:35,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108ee92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:45:35, skipping insertion in model container [2025-03-13 21:45:35,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:34" (2/3) ... [2025-03-13 21:45:35,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108ee92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:45:35, skipping insertion in model container [2025-03-13 21:45:35,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:45:35" (3/3) ... [2025-03-13 21:45:35,377 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-03-13 21:45:35,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:45:35,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 48 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:45:35,392 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:45:35,456 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-03-13 21:45:35,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 59 transitions, 158 flow [2025-03-13 21:45:35,511 INFO L124 PetriNetUnfolderBase]: 9/52 cut-off events. [2025-03-13 21:45:35,515 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:45:35,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 52 events. 9/52 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-03-13 21:45:35,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 59 transitions, 158 flow [2025-03-13 21:45:35,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 51 transitions, 132 flow [2025-03-13 21:45:35,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:45:35,541 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;@12acaf60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:45:35,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 21:45:35,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:45:35,557 INFO L124 PetriNetUnfolderBase]: 9/50 cut-off events. [2025-03-13 21:45:35,557 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:45:35,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:35,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:35,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:35,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1979527559, now seen corresponding path program 1 times [2025-03-13 21:45:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:35,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129014449] [2025-03-13 21:45:35,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:35,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:45:35,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:45:35,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:35,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:35,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:35,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129014449] [2025-03-13 21:45:35,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129014449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:35,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:35,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:45:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860586478] [2025-03-13 21:45:35,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:35,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:45:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:35,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:45:35,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:45:35,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:35,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:35,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:35,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:35,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:36,650 INFO L124 PetriNetUnfolderBase]: 8088/10948 cut-off events. [2025-03-13 21:45:36,650 INFO L125 PetriNetUnfolderBase]: For 686/686 co-relation queries the response was YES. [2025-03-13 21:45:36,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22845 conditions, 10948 events. 8088/10948 cut-off events. For 686/686 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 51634 event pairs, 6978 based on Foata normal form. 0/9822 useless extension candidates. Maximal degree in co-relation 22783. Up to 10923 conditions per place. [2025-03-13 21:45:36,702 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 44 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2025-03-13 21:45:36,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 214 flow [2025-03-13 21:45:36,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:45:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:45:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2025-03-13 21:45:36,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5163934426229508 [2025-03-13 21:45:36,713 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 132 flow. Second operand 2 states and 63 transitions. [2025-03-13 21:45:36,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 214 flow [2025-03-13 21:45:36,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:45:36,725 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 106 flow [2025-03-13 21:45:36,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-03-13 21:45:36,731 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2025-03-13 21:45:36,731 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 106 flow [2025-03-13 21:45:36,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:36,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:36,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:36,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:45:36,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:36,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1268123778, now seen corresponding path program 1 times [2025-03-13 21:45:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:36,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178701233] [2025-03-13 21:45:36,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:36,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:45:36,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:45:36,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:36,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:36,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:36,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178701233] [2025-03-13 21:45:36,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178701233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:36,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:36,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:36,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003034983] [2025-03-13 21:45:36,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:36,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:45:36,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:36,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:45:36,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:45:36,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:36,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:36,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:36,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:36,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:38,396 INFO L124 PetriNetUnfolderBase]: 19350/26141 cut-off events. [2025-03-13 21:45:38,396 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-03-13 21:45:38,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52854 conditions, 26141 events. 19350/26141 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 142616 event pairs, 6122 based on Foata normal form. 1/23233 useless extension candidates. Maximal degree in co-relation 52851. Up to 11645 conditions per place. [2025-03-13 21:45:38,520 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 106 selfloop transitions, 7 changer transitions 1/118 dead transitions. [2025-03-13 21:45:38,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 118 transitions, 490 flow [2025-03-13 21:45:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:45:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:45:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-03-13 21:45:38,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6024590163934426 [2025-03-13 21:45:38,522 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 106 flow. Second operand 4 states and 147 transitions. [2025-03-13 21:45:38,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 118 transitions, 490 flow [2025-03-13 21:45:38,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 118 transitions, 490 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:38,529 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 151 flow [2025-03-13 21:45:38,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2025-03-13 21:45:38,530 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2025-03-13 21:45:38,530 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 151 flow [2025-03-13 21:45:38,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:38,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:38,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:38,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:45:38,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:38,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1647210142, now seen corresponding path program 2 times [2025-03-13 21:45:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:38,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063129776] [2025-03-13 21:45:38,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:38,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:38,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:45:38,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:45:38,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:45:38,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:38,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:38,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063129776] [2025-03-13 21:45:38,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063129776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:38,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:38,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833949359] [2025-03-13 21:45:38,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:38,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:45:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:38,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:45:38,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:45:38,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:38,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:38,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:38,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:38,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:40,350 INFO L124 PetriNetUnfolderBase]: 30683/41318 cut-off events. [2025-03-13 21:45:40,351 INFO L125 PetriNetUnfolderBase]: For 4086/4086 co-relation queries the response was YES. [2025-03-13 21:45:40,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89848 conditions, 41318 events. 30683/41318 cut-off events. For 4086/4086 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 230914 event pairs, 14006 based on Foata normal form. 1/36749 useless extension candidates. Maximal degree in co-relation 89842. Up to 19516 conditions per place. [2025-03-13 21:45:40,573 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 112 selfloop transitions, 8 changer transitions 1/125 dead transitions. [2025-03-13 21:45:40,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 125 transitions, 570 flow [2025-03-13 21:45:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:45:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:45:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-03-13 21:45:40,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6065573770491803 [2025-03-13 21:45:40,576 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 151 flow. Second operand 4 states and 148 transitions. [2025-03-13 21:45:40,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 125 transitions, 570 flow [2025-03-13 21:45:40,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 125 transitions, 570 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:40,582 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 211 flow [2025-03-13 21:45:40,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2025-03-13 21:45:40,582 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2025-03-13 21:45:40,583 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 211 flow [2025-03-13 21:45:40,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:40,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:40,583 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:40,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:45:40,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:40,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1835845418, now seen corresponding path program 1 times [2025-03-13 21:45:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:40,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243904167] [2025-03-13 21:45:40,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:40,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:40,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:40,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:40,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:40,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:40,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243904167] [2025-03-13 21:45:40,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243904167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:40,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168095375] [2025-03-13 21:45:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:40,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:40,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:40,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:40,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:40,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:40,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:40,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:40,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:43,333 INFO L124 PetriNetUnfolderBase]: 42068/57206 cut-off events. [2025-03-13 21:45:43,333 INFO L125 PetriNetUnfolderBase]: For 16753/16759 co-relation queries the response was YES. [2025-03-13 21:45:43,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128512 conditions, 57206 events. 42068/57206 cut-off events. For 16753/16759 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 336814 event pairs, 32096 based on Foata normal form. 1244/51658 useless extension candidates. Maximal degree in co-relation 128503. Up to 41253 conditions per place. [2025-03-13 21:45:43,532 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 102 selfloop transitions, 5 changer transitions 2/113 dead transitions. [2025-03-13 21:45:43,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 113 transitions, 601 flow [2025-03-13 21:45:43,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-13 21:45:43,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4459016393442623 [2025-03-13 21:45:43,533 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 211 flow. Second operand 5 states and 136 transitions. [2025-03-13 21:45:43,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 113 transitions, 601 flow [2025-03-13 21:45:43,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 597 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-13 21:45:43,549 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 259 flow [2025-03-13 21:45:43,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-03-13 21:45:43,550 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2025-03-13 21:45:43,550 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 259 flow [2025-03-13 21:45:43,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:43,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:43,551 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:43,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:45:43,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:43,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:43,552 INFO L85 PathProgramCache]: Analyzing trace with hash 690532987, now seen corresponding path program 1 times [2025-03-13 21:45:43,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:43,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772471720] [2025-03-13 21:45:43,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:43,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:45:43,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:45:43,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:43,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:43,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:43,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772471720] [2025-03-13 21:45:43,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772471720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:43,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:43,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:45:43,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681514986] [2025-03-13 21:45:43,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:43,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:43,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:43,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:43,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:43,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:43,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:43,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:43,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:46,248 INFO L124 PetriNetUnfolderBase]: 37183/50532 cut-off events. [2025-03-13 21:45:46,249 INFO L125 PetriNetUnfolderBase]: For 15437/15437 co-relation queries the response was YES. [2025-03-13 21:45:46,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115709 conditions, 50532 events. 37183/50532 cut-off events. For 15437/15437 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 292337 event pairs, 28958 based on Foata normal form. 382/44990 useless extension candidates. Maximal degree in co-relation 115696. Up to 41253 conditions per place. [2025-03-13 21:45:46,485 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 54 selfloop transitions, 2 changer transitions 60/120 dead transitions. [2025-03-13 21:45:46,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 120 transitions, 634 flow [2025-03-13 21:45:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-03-13 21:45:46,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47540983606557374 [2025-03-13 21:45:46,487 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 259 flow. Second operand 5 states and 145 transitions. [2025-03-13 21:45:46,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 120 transitions, 634 flow [2025-03-13 21:45:46,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 630 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:46,503 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 235 flow [2025-03-13 21:45:46,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-03-13 21:45:46,504 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 15 predicate places. [2025-03-13 21:45:46,505 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 235 flow [2025-03-13 21:45:46,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:46,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:46,506 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:46,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:45:46,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:46,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash -724895840, now seen corresponding path program 1 times [2025-03-13 21:45:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:46,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939285209] [2025-03-13 21:45:46,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:46,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:46,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 21:45:46,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 21:45:46,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:46,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:46,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:46,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939285209] [2025-03-13 21:45:46,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939285209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162519343] [2025-03-13 21:45:46,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:46,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:46,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:46,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:45:46,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:45:46,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 21:45:46,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 21:45:46,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:46,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:46,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:45:46,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:46,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:46,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162519343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:46,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:46,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-13 21:45:46,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403155864] [2025-03-13 21:45:46,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:46,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:45:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:46,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:45:46,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:45:46,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:46,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 235 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:46,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:46,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:46,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:50,019 INFO L124 PetriNetUnfolderBase]: 46892/63464 cut-off events. [2025-03-13 21:45:50,020 INFO L125 PetriNetUnfolderBase]: For 28449/28449 co-relation queries the response was YES. [2025-03-13 21:45:50,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149702 conditions, 63464 events. 46892/63464 cut-off events. For 28449/28449 co-relation queries the response was YES. Maximal size of possible extension queue 1831. Compared 382267 event pairs, 24105 based on Foata normal form. 799/57077 useless extension candidates. Maximal degree in co-relation 149687. Up to 30623 conditions per place. [2025-03-13 21:45:50,302 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 159 selfloop transitions, 7 changer transitions 1/171 dead transitions. [2025-03-13 21:45:50,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 171 transitions, 955 flow [2025-03-13 21:45:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:45:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:45:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2025-03-13 21:45:50,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46604215456674475 [2025-03-13 21:45:50,304 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 235 flow. Second operand 7 states and 199 transitions. [2025-03-13 21:45:50,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 171 transitions, 955 flow [2025-03-13 21:45:50,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 171 transitions, 929 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-13 21:45:50,393 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 284 flow [2025-03-13 21:45:50,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=284, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-13 21:45:50,394 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2025-03-13 21:45:50,394 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 284 flow [2025-03-13 21:45:50,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:50,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:50,395 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:50,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:45:50,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-13 21:45:50,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:50,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1032602024, now seen corresponding path program 1 times [2025-03-13 21:45:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7236556] [2025-03-13 21:45:50,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:50,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 21:45:50,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 21:45:50,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:50,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:50,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:50,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7236556] [2025-03-13 21:45:50,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7236556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:50,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417787808] [2025-03-13 21:45:50,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:45:50,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:50,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:50,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:45:50,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:45:50,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 21:45:50,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 21:45:50,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:50,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:50,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:45:50,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:50,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:45:50,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417787808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:50,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:50,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-13 21:45:50,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847035075] [2025-03-13 21:45:50,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:50,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:45:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:50,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:45:50,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:45:50,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:50,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 284 flow. Second operand has 12 states, 12 states have (on average 13.583333333333334) internal successors, (163), 12 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:50,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:50,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:50,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:53,617 INFO L124 PetriNetUnfolderBase]: 36481/49836 cut-off events. [2025-03-13 21:45:53,618 INFO L125 PetriNetUnfolderBase]: For 23274/23280 co-relation queries the response was YES. [2025-03-13 21:45:53,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118928 conditions, 49836 events. 36481/49836 cut-off events. For 23274/23280 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 292064 event pairs, 17518 based on Foata normal form. 1460/45342 useless extension candidates. Maximal degree in co-relation 118913. Up to 21141 conditions per place. [2025-03-13 21:45:53,826 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 84 selfloop transitions, 5 changer transitions 47/140 dead transitions. [2025-03-13 21:45:53,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 807 flow [2025-03-13 21:45:53,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:45:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:45:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-03-13 21:45:53,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40749414519906324 [2025-03-13 21:45:53,828 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 284 flow. Second operand 7 states and 174 transitions. [2025-03-13 21:45:53,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 807 flow [2025-03-13 21:45:53,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 140 transitions, 799 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:45:53,844 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 278 flow [2025-03-13 21:45:53,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2025-03-13 21:45:53,844 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2025-03-13 21:45:53,844 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 278 flow [2025-03-13 21:45:53,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.583333333333334) internal successors, (163), 12 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:53,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:53,845 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:53,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:45:54,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-13 21:45:54,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:54,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2036084159, now seen corresponding path program 2 times [2025-03-13 21:45:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:54,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186239540] [2025-03-13 21:45:54,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:54,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:54,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:45:54,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:45:54,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:45:54,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:54,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:54,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186239540] [2025-03-13 21:45:54,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186239540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:54,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547961128] [2025-03-13 21:45:54,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:54,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:54,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:54,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:45:54,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:45:54,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:45:54,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:45:54,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:45:54,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:54,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:45:54,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:54,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547961128] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:54,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:45:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-13 21:45:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138900809] [2025-03-13 21:45:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:54,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:45:54,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:54,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:45:54,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:45:54,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:54,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:54,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:54,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:54,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:56,047 INFO L124 PetriNetUnfolderBase]: 23295/31570 cut-off events. [2025-03-13 21:45:56,048 INFO L125 PetriNetUnfolderBase]: For 25332/25338 co-relation queries the response was YES. [2025-03-13 21:45:56,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84389 conditions, 31570 events. 23295/31570 cut-off events. For 25332/25338 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 171175 event pairs, 11465 based on Foata normal form. 830/28805 useless extension candidates. Maximal degree in co-relation 84370. Up to 24878 conditions per place. [2025-03-13 21:45:56,177 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 76 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2025-03-13 21:45:56,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 87 transitions, 534 flow [2025-03-13 21:45:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:45:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:45:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-03-13 21:45:56,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3224043715846995 [2025-03-13 21:45:56,178 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 278 flow. Second operand 6 states and 118 transitions. [2025-03-13 21:45:56,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 87 transitions, 534 flow [2025-03-13 21:45:56,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 488 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-03-13 21:45:56,248 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 280 flow [2025-03-13 21:45:56,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2025-03-13 21:45:56,249 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2025-03-13 21:45:56,249 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 280 flow [2025-03-13 21:45:56,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:56,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:56,249 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:56,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:45:56,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:56,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:56,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:56,450 INFO L85 PathProgramCache]: Analyzing trace with hash -317540787, now seen corresponding path program 2 times [2025-03-13 21:45:56,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:56,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234100912] [2025-03-13 21:45:56,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:56,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:56,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:45:56,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 42 statements. [2025-03-13 21:45:56,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:45:56,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:45:56,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234100912] [2025-03-13 21:45:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234100912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:56,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:56,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:45:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134684402] [2025-03-13 21:45:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:56,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:56,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:56,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:56,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:56,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:56,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:56,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:56,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:58,673 INFO L124 PetriNetUnfolderBase]: 27479/37172 cut-off events. [2025-03-13 21:45:58,673 INFO L125 PetriNetUnfolderBase]: For 19112/19118 co-relation queries the response was YES. [2025-03-13 21:45:58,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95195 conditions, 37172 events. 27479/37172 cut-off events. For 19112/19118 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 203604 event pairs, 3773 based on Foata normal form. 361/33205 useless extension candidates. Maximal degree in co-relation 95180. Up to 24748 conditions per place. [2025-03-13 21:45:58,830 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 119 selfloop transitions, 7 changer transitions 1/131 dead transitions. [2025-03-13 21:45:58,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 131 transitions, 746 flow [2025-03-13 21:45:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:45:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:45:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-13 21:45:58,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4786885245901639 [2025-03-13 21:45:58,832 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 280 flow. Second operand 5 states and 146 transitions. [2025-03-13 21:45:58,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 131 transitions, 746 flow [2025-03-13 21:45:58,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 131 transitions, 726 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 21:45:58,849 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 312 flow [2025-03-13 21:45:58,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-03-13 21:45:58,849 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2025-03-13 21:45:58,849 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 312 flow [2025-03-13 21:45:58,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:58,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:58,850 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:58,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:45:58,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:45:58,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash -801705255, now seen corresponding path program 3 times [2025-03-13 21:45:58,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447066830] [2025-03-13 21:45:58,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:45:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:58,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:45:58,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 40 of 42 statements. [2025-03-13 21:45:58,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:45:58,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:45:58,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:58,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447066830] [2025-03-13 21:45:58,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447066830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:45:58,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:45:58,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:45:58,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793171767] [2025-03-13 21:45:58,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:45:58,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:45:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:58,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:45:58,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:45:58,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:45:58,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:58,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:58,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:45:58,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:00,830 INFO L124 PetriNetUnfolderBase]: 27407/37118 cut-off events. [2025-03-13 21:46:00,830 INFO L125 PetriNetUnfolderBase]: For 28621/28627 co-relation queries the response was YES. [2025-03-13 21:46:00,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97277 conditions, 37118 events. 27407/37118 cut-off events. For 28621/28627 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 205888 event pairs, 12337 based on Foata normal form. 74/32850 useless extension candidates. Maximal degree in co-relation 97260. Up to 30429 conditions per place. [2025-03-13 21:46:00,998 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 95 selfloop transitions, 8 changer transitions 14/121 dead transitions. [2025-03-13 21:46:00,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 121 transitions, 690 flow [2025-03-13 21:46:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:46:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:46:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2025-03-13 21:46:00,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45901639344262296 [2025-03-13 21:46:00,999 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 312 flow. Second operand 5 states and 140 transitions. [2025-03-13 21:46:00,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 121 transitions, 690 flow [2025-03-13 21:46:01,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 121 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:46:01,028 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 346 flow [2025-03-13 21:46:01,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-03-13 21:46:01,029 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2025-03-13 21:46:01,029 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 346 flow [2025-03-13 21:46:01,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:01,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:01,029 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:01,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:46:01,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:46:01,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1148038699, now seen corresponding path program 4 times [2025-03-13 21:46:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:01,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102059643] [2025-03-13 21:46:01,029 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:46:01,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:01,036 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:46:01,038 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 42 statements. [2025-03-13 21:46:01,039 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:46:01,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:46:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102059643] [2025-03-13 21:46:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102059643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:01,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:01,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:46:01,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771525718] [2025-03-13 21:46:01,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:01,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:01,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:01,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:01,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:46:01,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:01,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:01,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:46:01,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:03,849 INFO L124 PetriNetUnfolderBase]: 33689/45522 cut-off events. [2025-03-13 21:46:03,849 INFO L125 PetriNetUnfolderBase]: For 36477/36483 co-relation queries the response was YES. [2025-03-13 21:46:03,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120638 conditions, 45522 events. 33689/45522 cut-off events. For 36477/36483 co-relation queries the response was YES. Maximal size of possible extension queue 1342. Compared 257637 event pairs, 8203 based on Foata normal form. 361/40341 useless extension candidates. Maximal degree in co-relation 120620. Up to 28662 conditions per place. [2025-03-13 21:46:04,078 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 129 selfloop transitions, 13 changer transitions 2/148 dead transitions. [2025-03-13 21:46:04,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 148 transitions, 894 flow [2025-03-13 21:46:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:46:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:46:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-03-13 21:46:04,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5049180327868853 [2025-03-13 21:46:04,079 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 346 flow. Second operand 5 states and 154 transitions. [2025-03-13 21:46:04,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 148 transitions, 894 flow [2025-03-13 21:46:04,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 148 transitions, 878 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:46:04,121 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 403 flow [2025-03-13 21:46:04,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-03-13 21:46:04,122 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2025-03-13 21:46:04,122 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 403 flow [2025-03-13 21:46:04,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:04,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:04,122 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:04,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:46:04,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:46:04,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:04,123 INFO L85 PathProgramCache]: Analyzing trace with hash 555774153, now seen corresponding path program 5 times [2025-03-13 21:46:04,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:04,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936734190] [2025-03-13 21:46:04,123 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:46:04,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:04,130 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:46:04,136 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:46:04,136 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:46:04,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:04,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:04,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936734190] [2025-03-13 21:46:04,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936734190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:04,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605130944] [2025-03-13 21:46:04,203 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:46:04,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:04,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:04,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:46:04,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:46:04,265 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:46:04,292 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:46:04,292 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:46:04,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:04,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:46:04,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:46:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:04,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:46:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605130944] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:04,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:46:04,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-13 21:46:04,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49349300] [2025-03-13 21:46:04,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:04,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:46:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:04,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:46:04,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:46:04,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:46:04,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:04,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:04,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:46:04,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:06,917 INFO L124 PetriNetUnfolderBase]: 31109/42000 cut-off events. [2025-03-13 21:46:06,917 INFO L125 PetriNetUnfolderBase]: For 50403/50403 co-relation queries the response was YES. [2025-03-13 21:46:07,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115951 conditions, 42000 events. 31109/42000 cut-off events. For 50403/50403 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 234144 event pairs, 15800 based on Foata normal form. 447/37219 useless extension candidates. Maximal degree in co-relation 115931. Up to 23129 conditions per place. [2025-03-13 21:46:07,088 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 98 selfloop transitions, 12 changer transitions 1/115 dead transitions. [2025-03-13 21:46:07,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 789 flow [2025-03-13 21:46:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:46:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:46:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-03-13 21:46:07,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3469945355191257 [2025-03-13 21:46:07,089 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 403 flow. Second operand 6 states and 127 transitions. [2025-03-13 21:46:07,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 789 flow [2025-03-13 21:46:07,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 115 transitions, 784 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:07,186 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 444 flow [2025-03-13 21:46:07,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2025-03-13 21:46:07,187 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 31 predicate places. [2025-03-13 21:46:07,187 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 444 flow [2025-03-13 21:46:07,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:07,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:07,187 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:07,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:46:07,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:07,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:46:07,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash -635031018, now seen corresponding path program 1 times [2025-03-13 21:46:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:07,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808149691] [2025-03-13 21:46:07,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:07,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 21:46:07,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 21:46:07,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:07,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:07,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808149691] [2025-03-13 21:46:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808149691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369468223] [2025-03-13 21:46:07,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:07,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:07,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:07,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:46:07,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:46:08,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 21:46:08,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 21:46:08,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:08,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:08,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:46:08,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:46:08,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-13 21:46:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:46:08,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:46:08,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369468223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:08,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:46:08,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2025-03-13 21:46:08,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098453102] [2025-03-13 21:46:08,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:08,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:46:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:08,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:46:08,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:46:08,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-13 21:46:08,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 444 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:08,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:08,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-13 21:46:08,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand