./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --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/pthread-ext/09_fmaxsym.i -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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:26:56,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:26:57,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:26:57,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:26:57,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:26:57,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:26:57,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:26:57,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:26:57,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:26:57,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:26:57,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:26:57,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:26:57,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:26:57,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:26:57,030 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:26:57,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:26:57,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:26:57,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:26:57,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:26:57,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:26:57,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:26:57,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:26:57,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:57,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:26:57,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:26:57,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:26:57,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:26:57,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:26:57,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:26:57,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:26:57,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:26:57,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:26:57,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:26:57,034 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-03-13 21:26:57,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:26:57,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:26:57,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:26:57,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:26:57,276 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:26:57,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-13 21:26:58,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0919a7ceb/b2364a54ad1a40299aacc010425fbe6a/FLAGee54b1fd2 [2025-03-13 21:26:58,702 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:26:58,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-13 21:26:58,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0919a7ceb/b2364a54ad1a40299aacc010425fbe6a/FLAGee54b1fd2 [2025-03-13 21:26:59,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0919a7ceb/b2364a54ad1a40299aacc010425fbe6a [2025-03-13 21:26:59,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:26:59,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:26:59,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:59,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:26:59,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:26:59,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460f1c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59, skipping insertion in model container [2025-03-13 21:26:59,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:26:59,233 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/pthread-ext/09_fmaxsym.i[30746,30759] [2025-03-13 21:26:59,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:59,258 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:26:59,293 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/pthread-ext/09_fmaxsym.i[30746,30759] [2025-03-13 21:26:59,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:59,325 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:26:59,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59 WrapperNode [2025-03-13 21:26:59,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:59,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:59,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:26:59,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:26:59,332 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:26:59" (1/1) ... [2025-03-13 21:26:59,339 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:26:59" (1/1) ... [2025-03-13 21:26:59,356 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2025-03-13 21:26:59,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:59,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:26:59,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:26:59,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:26:59,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,372 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-03-13 21:26:59,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:26:59,380 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:26:59,380 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:26:59,380 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:26:59,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (1/1) ... [2025-03-13 21:26:59,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:59,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:59,415 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:26:59,425 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:26:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:26:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:26:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:26:59,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:26:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:26:59,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:26:59,442 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:26:59,541 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:26:59,542 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:26:59,712 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:26:59,712 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:26:59,713 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:26:59,843 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:26:59,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:59 BoogieIcfgContainer [2025-03-13 21:26:59,845 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:26:59,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:26:59,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:26:59,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:26:59,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:26:59" (1/3) ... [2025-03-13 21:26:59,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e91dd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:59, skipping insertion in model container [2025-03-13 21:26:59,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:59" (2/3) ... [2025-03-13 21:26:59,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e91dd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:59, skipping insertion in model container [2025-03-13 21:26:59,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:59" (3/3) ... [2025-03-13 21:26:59,853 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-13 21:26:59,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:26:59,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 20 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-13 21:26:59,865 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:26:59,898 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:26:59,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 23 transitions, 50 flow [2025-03-13 21:26:59,941 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-03-13 21:26:59,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:26:59,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 3/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-13 21:26:59,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 23 transitions, 50 flow [2025-03-13 21:26:59,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 23 transitions, 50 flow [2025-03-13 21:26:59,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:26:59,967 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;@2663a3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:26:59,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:26:59,972 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:26:59,973 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-13 21:26:59,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:26:59,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:59,974 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-13 21:26:59,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:26:59,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1442357673, now seen corresponding path program 1 times [2025-03-13 21:26:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658267059] [2025-03-13 21:26:59,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:00,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:27:00,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:27:00,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:00,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:00,171 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:27:00,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:00,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658267059] [2025-03-13 21:27:00,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658267059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:00,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:00,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:00,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902985230] [2025-03-13 21:27:00,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:00,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:00,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:00,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:00,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:00,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-13 21:27:00,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:27:00,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:00,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-13 21:27:00,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:00,255 INFO L124 PetriNetUnfolderBase]: 20/68 cut-off events. [2025-03-13 21:27:00,256 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:27:00,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 68 events. 20/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 16 based on Foata normal form. 3/64 useless extension candidates. Maximal degree in co-relation 105. Up to 51 conditions per place. [2025-03-13 21:27:00,260 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 14 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-03-13 21:27:00,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 80 flow [2025-03-13 21:27:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-03-13 21:27:00,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2025-03-13 21:27:00,272 INFO L175 Difference]: Start difference. First operand has 23 places, 23 transitions, 50 flow. Second operand 3 states and 37 transitions. [2025-03-13 21:27:00,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 80 flow [2025-03-13 21:27:00,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:27:00,276 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 58 flow [2025-03-13 21:27:00,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2025-03-13 21:27:00,281 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-03-13 21:27:00,281 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 58 flow [2025-03-13 21:27:00,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:27:00,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:00,282 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:00,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:27:00,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:27:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1237163028, now seen corresponding path program 1 times [2025-03-13 21:27:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327297217] [2025-03-13 21:27:00,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:00,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:27:00,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:27:00,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:00,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:00,366 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:27:00,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:00,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327297217] [2025-03-13 21:27:00,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327297217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:00,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707180662] [2025-03-13 21:27:00,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:00,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:00,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:00,369 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:27:00,372 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:27:00,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:27:00,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:27:00,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:00,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:00,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:27:00,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:00,461 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:27:00,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:00,479 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:27:00,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707180662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:00,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:00,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:27:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809107858] [2025-03-13 21:27:00,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:00,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:27:00,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:00,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:27:00,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:27:00,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-13 21:27:00,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 58 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:27:00,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:00,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-13 21:27:00,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:00,544 INFO L124 PetriNetUnfolderBase]: 20/71 cut-off events. [2025-03-13 21:27:00,544 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:27:00,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 71 events. 20/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 16 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 128. Up to 51 conditions per place. [2025-03-13 21:27:00,545 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 14 selfloop transitions, 5 changer transitions 0/25 dead transitions. [2025-03-13 21:27:00,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 108 flow [2025-03-13 21:27:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:27:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:27:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-03-13 21:27:00,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42028985507246375 [2025-03-13 21:27:00,547 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 58 flow. Second operand 6 states and 58 transitions. [2025-03-13 21:27:00,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 108 flow [2025-03-13 21:27:00,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 104 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:00,549 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 90 flow [2025-03-13 21:27:00,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2025-03-13 21:27:00,549 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2025-03-13 21:27:00,549 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 90 flow [2025-03-13 21:27:00,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:27:00,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:00,549 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-13 21:27:00,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:27:00,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:00,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:27:00,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1667668887, now seen corresponding path program 2 times [2025-03-13 21:27:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728710146] [2025-03-13 21:27:00,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:00,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:27:00,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:27:00,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:00,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728710146] [2025-03-13 21:27:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728710146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630851673] [2025-03-13 21:27:00,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:00,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:00,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:00,873 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:27:00,873 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:27:00,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:27:00,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:27:00,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:00,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:27:00,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:00,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630851673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:01,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-13 21:27:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102103146] [2025-03-13 21:27:01,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:01,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:27:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:01,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:27:01,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:27:01,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-13 21:27:01,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:27:01,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:01,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-13 21:27:01,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:01,068 INFO L124 PetriNetUnfolderBase]: 20/73 cut-off events. [2025-03-13 21:27:01,068 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 21:27:01,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 73 events. 20/73 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 16 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 119. Up to 51 conditions per place. [2025-03-13 21:27:01,069 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 14 selfloop transitions, 7 changer transitions 0/27 dead transitions. [2025-03-13 21:27:01,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 144 flow [2025-03-13 21:27:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:27:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:27:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2025-03-13 21:27:01,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3858695652173913 [2025-03-13 21:27:01,070 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 90 flow. Second operand 8 states and 71 transitions. [2025-03-13 21:27:01,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 144 flow [2025-03-13 21:27:01,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 130 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:01,072 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 112 flow [2025-03-13 21:27:01,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2025-03-13 21:27:01,072 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 17 predicate places. [2025-03-13 21:27:01,072 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 112 flow [2025-03-13 21:27:01,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:27:01,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:01,073 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-03-13 21:27:01,079 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:27:01,273 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,SelfDestructingSolverStorable2 [2025-03-13 21:27:01,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-13 21:27:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 267189815, now seen corresponding path program 3 times [2025-03-13 21:27:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:01,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831414468] [2025-03-13 21:27:01,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:27:01,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:01,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-03-13 21:27:01,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:27:01,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-13 21:27:01,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:01,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:01,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:27:01,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:27:01,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:01,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:01,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:01,357 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:01,357 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-13 21:27:01,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-13 21:27:01,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-13 21:27:01,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:27:01,359 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-13 21:27:01,361 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:01,361 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:27:01,375 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:01,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 39 transitions, 88 flow [2025-03-13 21:27:01,383 INFO L124 PetriNetUnfolderBase]: 5/44 cut-off events. [2025-03-13 21:27:01,384 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:27:01,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 44 events. 5/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2025-03-13 21:27:01,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 39 transitions, 88 flow [2025-03-13 21:27:01,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 39 transitions, 88 flow [2025-03-13 21:27:01,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:01,387 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;@2663a3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:01,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:27:01,393 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:01,394 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-03-13 21:27:01,394 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:27:01,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:01,394 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:27:01,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:27:01,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2110155687, now seen corresponding path program 1 times [2025-03-13 21:27:01,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:01,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650213536] [2025-03-13 21:27:01,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:01,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:27:01,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:27:01,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:01,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:01,427 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:27:01,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:01,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650213536] [2025-03-13 21:27:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650213536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:01,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:01,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:01,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257579767] [2025-03-13 21:27:01,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:01,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:01,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:01,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:01,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:01,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-03-13 21:27:01,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:27:01,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:01,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-03-13 21:27:01,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:01,573 INFO L124 PetriNetUnfolderBase]: 434/922 cut-off events. [2025-03-13 21:27:01,573 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-13 21:27:01,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 922 events. 434/922 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4763 event pairs, 376 based on Foata normal form. 51/864 useless extension candidates. Maximal degree in co-relation 1014. Up to 708 conditions per place. [2025-03-13 21:27:01,579 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 24 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-13 21:27:01,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 136 flow [2025-03-13 21:27:01,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-03-13 21:27:01,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-13 21:27:01,583 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 88 flow. Second operand 3 states and 63 transitions. [2025-03-13 21:27:01,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 136 flow [2025-03-13 21:27:01,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:27:01,584 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 94 flow [2025-03-13 21:27:01,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-13 21:27:01,585 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-03-13 21:27:01,585 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 94 flow [2025-03-13 21:27:01,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:27:01,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:01,588 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:01,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:27:01,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:27:01,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1963736409, now seen corresponding path program 1 times [2025-03-13 21:27:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752763391] [2025-03-13 21:27:01,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:01,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:27:01,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:27:01,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:01,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:01,644 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:27:01,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752763391] [2025-03-13 21:27:01,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752763391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80946528] [2025-03-13 21:27:01,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:01,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:01,649 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:27:01,658 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:27:01,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:27:01,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:27:01,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:01,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:01,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:27:01,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:01,733 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:27:01,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:01,750 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:27:01,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80946528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:01,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:01,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:27:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003903218] [2025-03-13 21:27:01,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:01,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:27:01,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:01,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:27:01,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:27:01,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-03-13 21:27:01,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:27:01,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:01,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-03-13 21:27:01,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:01,883 INFO L124 PetriNetUnfolderBase]: 434/925 cut-off events. [2025-03-13 21:27:01,884 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-13 21:27:01,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 925 events. 434/925 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4754 event pairs, 376 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1666. Up to 708 conditions per place. [2025-03-13 21:27:01,889 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 24 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2025-03-13 21:27:01,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 164 flow [2025-03-13 21:27:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:27:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:27:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-13 21:27:01,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4188034188034188 [2025-03-13 21:27:01,892 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 94 flow. Second operand 6 states and 98 transitions. [2025-03-13 21:27:01,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 164 flow [2025-03-13 21:27:01,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 160 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:01,893 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 126 flow [2025-03-13 21:27:01,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-03-13 21:27:01,893 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2025-03-13 21:27:01,894 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 126 flow [2025-03-13 21:27:01,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:27:01,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:01,894 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:27:01,905 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:27:02,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:02,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:27:02,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:02,095 INFO L85 PathProgramCache]: Analyzing trace with hash 159795239, now seen corresponding path program 2 times [2025-03-13 21:27:02,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:02,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449016904] [2025-03-13 21:27:02,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:02,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-13 21:27:02,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:02,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:02,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:02,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:02,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:02,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449016904] [2025-03-13 21:27:02,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449016904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:02,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217565331] [2025-03-13 21:27:02,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:02,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:02,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:02,175 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:27:02,176 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:27:02,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-13 21:27:02,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:02,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:02,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:02,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:27:02,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:02,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:02,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217565331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:02,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:02,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-13 21:27:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408844006] [2025-03-13 21:27:02,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:02,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:27:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:02,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:27:02,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:27:02,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-03-13 21:27:02,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 126 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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:27:02,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:02,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-03-13 21:27:02,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:02,427 INFO L124 PetriNetUnfolderBase]: 434/927 cut-off events. [2025-03-13 21:27:02,427 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-13 21:27:02,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 927 events. 434/927 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4767 event pairs, 376 based on Foata normal form. 2/821 useless extension candidates. Maximal degree in co-relation 1657. Up to 708 conditions per place. [2025-03-13 21:27:02,432 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 24 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2025-03-13 21:27:02,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 42 transitions, 200 flow [2025-03-13 21:27:02,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:27:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:27:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2025-03-13 21:27:02,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38782051282051283 [2025-03-13 21:27:02,434 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 126 flow. Second operand 8 states and 121 transitions. [2025-03-13 21:27:02,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 42 transitions, 200 flow [2025-03-13 21:27:02,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 42 transitions, 186 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:02,435 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 148 flow [2025-03-13 21:27:02,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-03-13 21:27:02,436 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2025-03-13 21:27:02,436 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 148 flow [2025-03-13 21:27:02,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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:27:02,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:02,436 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:27:02,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-13 21:27:02,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:02,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-13 21:27:02,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash 29056615, now seen corresponding path program 3 times [2025-03-13 21:27:02,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:02,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691112455] [2025-03-13 21:27:02,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:27:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:02,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-03-13 21:27:02,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:27:02,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-13 21:27:02,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:02,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:02,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:27:02,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:27:02,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:02,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:02,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:02,679 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:02,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-13 21:27:02,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-13 21:27:02,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-13 21:27:02,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-13 21:27:02,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:27:02,680 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-13 21:27:02,680 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:02,680 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:27:02,699 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:02,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 128 flow [2025-03-13 21:27:02,705 INFO L124 PetriNetUnfolderBase]: 7/63 cut-off events. [2025-03-13 21:27:02,706 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:27:02,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 7/63 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2025-03-13 21:27:02,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 128 flow [2025-03-13 21:27:02,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 128 flow [2025-03-13 21:27:02,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:02,708 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;@2663a3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:02,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:27:02,713 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:02,713 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-03-13 21:27:02,713 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:27:02,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:02,713 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:02,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:27:02,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1208067956, now seen corresponding path program 1 times [2025-03-13 21:27:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:02,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090350757] [2025-03-13 21:27:02,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:02,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:02,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:27:02,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:27:02,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:02,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:02,742 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:27:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090350757] [2025-03-13 21:27:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090350757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:02,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:02,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:02,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569812161] [2025-03-13 21:27:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:02,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:02,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:02,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:02,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:02,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-13 21:27:02,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:27:02,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:02,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-13 21:27:02,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:03,438 INFO L124 PetriNetUnfolderBase]: 6347/10809 cut-off events. [2025-03-13 21:27:03,438 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2025-03-13 21:27:03,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19975 conditions, 10809 events. 6347/10809 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 74739 event pairs, 5560 based on Foata normal form. 713/10235 useless extension candidates. Maximal degree in co-relation 1663. Up to 8808 conditions per place. [2025-03-13 21:27:03,508 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-03-13 21:27:03,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 194 flow [2025-03-13 21:27:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-13 21:27:03,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2025-03-13 21:27:03,510 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 128 flow. Second operand 3 states and 89 transitions. [2025-03-13 21:27:03,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 194 flow [2025-03-13 21:27:03,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:27:03,513 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 130 flow [2025-03-13 21:27:03,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-03-13 21:27:03,514 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-03-13 21:27:03,515 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 130 flow [2025-03-13 21:27:03,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:27:03,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:03,515 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:03,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:27:03,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:27:03,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:03,516 INFO L85 PathProgramCache]: Analyzing trace with hash 882209195, now seen corresponding path program 1 times [2025-03-13 21:27:03,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:03,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090898814] [2025-03-13 21:27:03,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:03,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:27:03,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:03,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:03,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:03,554 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:27:03,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090898814] [2025-03-13 21:27:03,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090898814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342085220] [2025-03-13 21:27:03,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:03,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:03,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:03,556 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:27:03,558 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:27:03,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:27:03,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:03,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:03,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:03,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:27:03,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:03,629 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:27:03,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:03,645 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:27:03,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342085220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:03,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:03,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:27:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255755239] [2025-03-13 21:27:03,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:03,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:27:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:03,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:27:03,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:27:03,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-13 21:27:03,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 130 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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:27:03,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:03,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-13 21:27:03,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:04,307 INFO L124 PetriNetUnfolderBase]: 6347/10812 cut-off events. [2025-03-13 21:27:04,308 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2025-03-13 21:27:04,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19910 conditions, 10812 events. 6347/10812 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 74712 event pairs, 5560 based on Foata normal form. 0/9525 useless extension candidates. Maximal degree in co-relation 19896. Up to 8808 conditions per place. [2025-03-13 21:27:04,359 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 34 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-03-13 21:27:04,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 220 flow [2025-03-13 21:27:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:27:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:27:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-13 21:27:04,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2025-03-13 21:27:04,360 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 130 flow. Second operand 6 states and 138 transitions. [2025-03-13 21:27:04,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 220 flow [2025-03-13 21:27:04,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 216 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:04,362 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 162 flow [2025-03-13 21:27:04,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-13 21:27:04,362 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2025-03-13 21:27:04,362 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 162 flow [2025-03-13 21:27:04,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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:27:04,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:04,365 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:04,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 21:27:04,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-13 21:27:04,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:27:04,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1279394508, now seen corresponding path program 2 times [2025-03-13 21:27:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:04,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277394459] [2025-03-13 21:27:04,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:04,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:27:04,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:27:04,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:04,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:04,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:04,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277394459] [2025-03-13 21:27:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277394459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:04,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74658877] [2025-03-13 21:27:04,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:04,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:04,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:04,640 INFO L229 MonitoredProcess]: Starting monitored process 7 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:27:04,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:27:04,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:27:04,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:27:04,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:27:04,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:04,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:27:04,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:04,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74658877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:04,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:04,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-13 21:27:04,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392207744] [2025-03-13 21:27:04,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:04,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:27:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:04,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:27:04,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:27:04,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-13 21:27:04,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 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:27:04,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:04,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-13 21:27:04,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:05,394 INFO L124 PetriNetUnfolderBase]: 6347/10814 cut-off events. [2025-03-13 21:27:05,395 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2025-03-13 21:27:05,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19931 conditions, 10814 events. 6347/10814 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 74790 event pairs, 5560 based on Foata normal form. 2/9530 useless extension candidates. Maximal degree in co-relation 19887. Up to 8808 conditions per place. [2025-03-13 21:27:05,445 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 34 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2025-03-13 21:27:05,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 256 flow [2025-03-13 21:27:05,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:27:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:27:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-03-13 21:27:05,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3886363636363636 [2025-03-13 21:27:05,448 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 162 flow. Second operand 8 states and 171 transitions. [2025-03-13 21:27:05,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 256 flow [2025-03-13 21:27:05,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 57 transitions, 242 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:05,451 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 184 flow [2025-03-13 21:27:05,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2025-03-13 21:27:05,453 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2025-03-13 21:27:05,453 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 184 flow [2025-03-13 21:27:05,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 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:27:05,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:05,453 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:05,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:27:05,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:05,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-13 21:27:05,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1215878164, now seen corresponding path program 3 times [2025-03-13 21:27:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:05,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706719388] [2025-03-13 21:27:05,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:27:05,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:05,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-03-13 21:27:05,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:27:05,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-13 21:27:05,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:05,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:27:05,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:27:05,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:27:05,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:05,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:27:05,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:27:05,692 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:27:05,692 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 21:27:05,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-13 21:27:05,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-13 21:27:05,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-13 21:27:05,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-13 21:27:05,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:27:05,693 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-13 21:27:05,695 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:27:05,695 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:27:05,727 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:27:05,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 170 flow [2025-03-13 21:27:05,736 INFO L124 PetriNetUnfolderBase]: 9/82 cut-off events. [2025-03-13 21:27:05,736 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:27:05,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 9/82 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 73. Up to 5 conditions per place. [2025-03-13 21:27:05,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 170 flow [2025-03-13 21:27:05,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 170 flow [2025-03-13 21:27:05,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:27:05,739 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;@2663a3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:27:05,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:27:05,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:27:05,743 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2025-03-13 21:27:05,743 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-13 21:27:05,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:05,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:05,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:27:05,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:05,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1643160243, now seen corresponding path program 1 times [2025-03-13 21:27:05,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:05,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316406145] [2025-03-13 21:27:05,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:05,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:05,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:27:05,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:27:05,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:05,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:05,769 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:27:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316406145] [2025-03-13 21:27:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316406145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:05,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:05,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:27:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818795641] [2025-03-13 21:27:05,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:05,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:05,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:05,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:05,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:05,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2025-03-13 21:27:05,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:27:05,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:05,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2025-03-13 21:27:05,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:11,661 INFO L124 PetriNetUnfolderBase]: 79247/119475 cut-off events. [2025-03-13 21:27:11,661 INFO L125 PetriNetUnfolderBase]: For 9589/9589 co-relation queries the response was YES. [2025-03-13 21:27:11,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224870 conditions, 119475 events. 79247/119475 cut-off events. For 9589/9589 co-relation queries the response was YES. Maximal size of possible extension queue 3779. Compared 958700 event pairs, 69712 based on Foata normal form. 8858/114257 useless extension candidates. Maximal degree in co-relation 20055. Up to 101391 conditions per place. [2025-03-13 21:27:12,272 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 44 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2025-03-13 21:27:12,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 254 flow [2025-03-13 21:27:12,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-03-13 21:27:12,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.539906103286385 [2025-03-13 21:27:12,273 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 170 flow. Second operand 3 states and 115 transitions. [2025-03-13 21:27:12,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 254 flow [2025-03-13 21:27:12,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 248 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 21:27:12,279 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 166 flow [2025-03-13 21:27:12,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2025-03-13 21:27:12,280 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2025-03-13 21:27:12,281 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 166 flow [2025-03-13 21:27:12,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:27:12,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:12,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:12,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:27:12,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:27:12,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash 802116093, now seen corresponding path program 1 times [2025-03-13 21:27:12,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:12,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154830625] [2025-03-13 21:27:12,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:12,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:12,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:27:12,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:27:12,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:12,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:12,321 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:27:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154830625] [2025-03-13 21:27:12,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154830625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304269704] [2025-03-13 21:27:12,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:12,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:12,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:12,324 INFO L229 MonitoredProcess]: Starting monitored process 8 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:27:12,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:27:12,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:27:12,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:27:12,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:12,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:12,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:27:12,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:12,401 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:27:12,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:12,413 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:27:12,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304269704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:12,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:27:12,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070384496] [2025-03-13 21:27:12,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:12,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:27:12,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:12,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:27:12,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:27:12,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2025-03-13 21:27:12,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 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:27:12,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:12,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2025-03-13 21:27:12,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:18,243 INFO L124 PetriNetUnfolderBase]: 79247/119478 cut-off events. [2025-03-13 21:27:18,243 INFO L125 PetriNetUnfolderBase]: For 4319/4319 co-relation queries the response was YES. [2025-03-13 21:27:18,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223347 conditions, 119478 events. 79247/119478 cut-off events. For 4319/4319 co-relation queries the response was YES. Maximal size of possible extension queue 3779. Compared 958519 event pairs, 69712 based on Foata normal form. 0/105402 useless extension candidates. Maximal degree in co-relation 223332. Up to 101391 conditions per place. [2025-03-13 21:27:18,791 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 44 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2025-03-13 21:27:18,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 276 flow [2025-03-13 21:27:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:27:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:27:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-03-13 21:27:18,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41784037558685444 [2025-03-13 21:27:18,792 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 166 flow. Second operand 6 states and 178 transitions. [2025-03-13 21:27:18,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 276 flow [2025-03-13 21:27:18,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 272 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:18,806 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 198 flow [2025-03-13 21:27:18,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2025-03-13 21:27:18,806 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2025-03-13 21:27:18,806 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 198 flow [2025-03-13 21:27:18,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 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:27:18,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:18,807 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:18,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 21:27:19,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:19,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:27:19,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash 146737485, now seen corresponding path program 2 times [2025-03-13 21:27:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:19,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306579719] [2025-03-13 21:27:19,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:27:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:19,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:27:19,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 18 statements. [2025-03-13 21:27:19,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:27:19,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:27:19,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:19,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306579719] [2025-03-13 21:27:19,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306579719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:27:19,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:27:19,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:27:19,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074465507] [2025-03-13 21:27:19,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:27:19,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:27:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:19,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:27:19,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:27:19,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2025-03-13 21:27:19,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:27:19,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:19,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2025-03-13 21:27:19,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:27:27,227 INFO L124 PetriNetUnfolderBase]: 99317/141309 cut-off events. [2025-03-13 21:27:27,227 INFO L125 PetriNetUnfolderBase]: For 4035/4035 co-relation queries the response was YES. [2025-03-13 21:27:27,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270727 conditions, 141309 events. 99317/141309 cut-off events. For 4035/4035 co-relation queries the response was YES. Maximal size of possible extension queue 3804. Compared 1042971 event pairs, 37636 based on Foata normal form. 0/124816 useless extension candidates. Maximal degree in co-relation 270690. Up to 67590 conditions per place. [2025-03-13 21:27:28,204 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 81 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-03-13 21:27:28,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 102 transitions, 445 flow [2025-03-13 21:27:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:27:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:27:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-13 21:27:28,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.647887323943662 [2025-03-13 21:27:28,206 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 198 flow. Second operand 3 states and 138 transitions. [2025-03-13 21:27:28,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 102 transitions, 445 flow [2025-03-13 21:27:28,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 102 transitions, 431 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:27:28,218 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 197 flow [2025-03-13 21:27:28,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2025-03-13 21:27:28,219 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2025-03-13 21:27:28,220 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 197 flow [2025-03-13 21:27:28,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:27:28,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:27:28,220 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:27:28,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:27:28,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:27:28,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:27:28,221 INFO L85 PathProgramCache]: Analyzing trace with hash -450104348, now seen corresponding path program 1 times [2025-03-13 21:27:28,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:27:28,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108487697] [2025-03-13 21:27:28,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:28,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:27:28,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:27:28,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:27:28,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:28,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:28,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:27:28,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108487697] [2025-03-13 21:27:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108487697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:27:28,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677768174] [2025-03-13 21:27:28,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:27:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:27:28,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:27:28,308 INFO L229 MonitoredProcess]: Starting monitored process 9 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:27:28,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:27:28,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:27:28,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:27:28,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:27:28,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:27:28,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:27:28,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:27:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:28,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:27:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:27:28,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677768174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:27:28,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:27:28,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-13 21:27:28,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955929183] [2025-03-13 21:27:28,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:27:28,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:27:28,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:27:28,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:27:28,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:27:28,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2025-03-13 21:27:28,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 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:27:28,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:27:28,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2025-03-13 21:27:28,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand