./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.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/goblint-regression/28-race_reach_72-funloop_hard_racing.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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:39:25,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:39:25,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:39:25,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:39:25,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:39:25,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:39:25,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:39:25,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:39:25,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:39:25,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:39:25,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:39:25,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:39:25,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:39:25,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:39:25,149 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:39:25,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:39:25,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:39:25,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:39:25,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:39:25,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:39:25,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:39:25,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:39:25,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:39:25,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:39:25,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:39:25,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:39:25,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:39:25,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:39:25,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:39:25,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:39:25,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:39:25,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:39:25,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:39:25,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:39:25,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:39:25,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:39:25,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:39:25,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:39:25,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:39:25,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:39:25,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:39:25,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:39:25,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:39:25,152 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-03-13 21:39:25,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:39:25,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:39:25,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:39:25,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:39:25,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:39:25,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-13 21:39:26,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89a4df22/2169ed962ce64b02b29b3066728d64b8/FLAG2b729cd9a [2025-03-13 21:39:26,838 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:39:26,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-13 21:39:26,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89a4df22/2169ed962ce64b02b29b3066728d64b8/FLAG2b729cd9a [2025-03-13 21:39:26,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89a4df22/2169ed962ce64b02b29b3066728d64b8 [2025-03-13 21:39:26,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:39:26,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:39:26,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:39:26,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:39:26,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:39:26,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b155a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26, skipping insertion in model container [2025-03-13 21:39:26,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:39:27,267 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/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2025-03-13 21:39:27,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:39:27,339 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:39:27,381 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/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2025-03-13 21:39:27,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:39:27,442 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:39:27,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27 WrapperNode [2025-03-13 21:39:27,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:39:27,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:39:27,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:39:27,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:39:27,447 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:39:27" (1/1) ... [2025-03-13 21:39:27,458 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:39:27" (1/1) ... [2025-03-13 21:39:27,478 INFO L138 Inliner]: procedures = 272, calls = 109, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 314 [2025-03-13 21:39:27,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:39:27,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:39:27,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:39:27,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:39:27,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,501 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 75, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 7 writes are split as follows [0, 0, 6, 1]. [2025-03-13 21:39:27,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:39:27,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:39:27,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:39:27,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:39:27,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (1/1) ... [2025-03-13 21:39:27,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:39:27,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:27,553 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:39:27,558 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:39:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 21:39:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 21:39:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:39:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:39:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:39:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:39:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-13 21:39:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 21:39:27,576 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-13 21:39:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:39:27,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:39:27,577 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:39:27,691 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:39:27,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:39:27,976 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 21:39:27,976 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-13 21:39:28,047 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:39:28,049 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:39:28,050 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:39:28,392 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:39:28,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:39:28 BoogieIcfgContainer [2025-03-13 21:39:28,394 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:39:28,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:39:28,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:39:28,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:39:28,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:39:26" (1/3) ... [2025-03-13 21:39:28,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef3b556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:39:28, skipping insertion in model container [2025-03-13 21:39:28,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:27" (2/3) ... [2025-03-13 21:39:28,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef3b556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:39:28, skipping insertion in model container [2025-03-13 21:39:28,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:39:28" (3/3) ... [2025-03-13 21:39:28,401 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-03-13 21:39:28,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:39:28,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 94 locations, 1 initial locations, 17 loop locations, and 3 error locations. [2025-03-13 21:39:28,413 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:39:28,454 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 21:39:28,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 134 transitions, 275 flow [2025-03-13 21:39:28,539 INFO L124 PetriNetUnfolderBase]: 65/218 cut-off events. [2025-03-13 21:39:28,543 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:39:28,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 218 events. 65/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1015 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2025-03-13 21:39:28,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 134 transitions, 275 flow [2025-03-13 21:39:28,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 132 transitions, 268 flow [2025-03-13 21:39:28,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:39:28,574 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;@44390e10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:39:28,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:39:28,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:39:28,586 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-03-13 21:39:28,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:39:28,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:28,588 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-13 21:39:28,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:39:28,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:28,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1878025250, now seen corresponding path program 1 times [2025-03-13 21:39:28,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:28,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323511471] [2025-03-13 21:39:28,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:28,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:39:28,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:39:28,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:28,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:28,881 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:39:28,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323511471] [2025-03-13 21:39:28,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323511471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:28,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:39:28,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:39:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450659146] [2025-03-13 21:39:28,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:28,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:28,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:28,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:28,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:39:28,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 134 [2025-03-13 21:39:28,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 132 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:39:28,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:28,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 134 [2025-03-13 21:39:28,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:29,251 INFO L124 PetriNetUnfolderBase]: 803/2154 cut-off events. [2025-03-13 21:39:29,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:39:29,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 2154 events. 803/2154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 15757 event pairs, 666 based on Foata normal form. 452/2372 useless extension candidates. Maximal degree in co-relation 3546. Up to 1503 conditions per place. [2025-03-13 21:39:29,272 INFO L140 encePairwiseOnDemand]: 98/134 looper letters, 60 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-03-13 21:39:29,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 100 transitions, 328 flow [2025-03-13 21:39:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:39:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:39:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-13 21:39:29,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5223880597014925 [2025-03-13 21:39:29,282 INFO L175 Difference]: Start difference. First operand has 96 places, 132 transitions, 268 flow. Second operand 3 states and 210 transitions. [2025-03-13 21:39:29,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 100 transitions, 328 flow [2025-03-13 21:39:29,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 100 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:39:29,289 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 214 flow [2025-03-13 21:39:29,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2025-03-13 21:39:29,295 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 3 predicate places. [2025-03-13 21:39:29,296 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 214 flow [2025-03-13 21:39:29,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:39:29,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:29,296 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:29,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:39:29,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:39:29,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1531619178, now seen corresponding path program 1 times [2025-03-13 21:39:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:29,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688167090] [2025-03-13 21:39:29,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:29,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:39:29,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:39:29,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:29,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:29,430 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:39:29,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:29,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688167090] [2025-03-13 21:39:29,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688167090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481401173] [2025-03-13 21:39:29,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:29,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:29,434 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:39:29,435 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:39:29,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:39:29,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:39:29,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:29,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:29,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:39:29,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:29,553 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:39:29,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:29,570 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:39:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481401173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:29,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:29,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:39:29,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685093719] [2025-03-13 21:39:29,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:29,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:39:29,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:29,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:39:29,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:39:29,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 134 [2025-03-13 21:39:29,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 7 states have internal predecessors, (277), 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:39:29,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:29,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 134 [2025-03-13 21:39:29,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:29,933 INFO L124 PetriNetUnfolderBase]: 803/2157 cut-off events. [2025-03-13 21:39:29,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:39:29,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 2157 events. 803/2157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15738 event pairs, 666 based on Foata normal form. 0/1923 useless extension candidates. Maximal degree in co-relation 3666. Up to 1503 conditions per place. [2025-03-13 21:39:29,943 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 60 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-03-13 21:39:29,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 103 transitions, 356 flow [2025-03-13 21:39:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:39:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:39:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 296 transitions. [2025-03-13 21:39:29,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3681592039800995 [2025-03-13 21:39:29,945 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 214 flow. Second operand 6 states and 296 transitions. [2025-03-13 21:39:29,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 103 transitions, 356 flow [2025-03-13 21:39:29,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 103 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:29,948 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 246 flow [2025-03-13 21:39:29,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2025-03-13 21:39:29,949 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2025-03-13 21:39:29,949 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 246 flow [2025-03-13 21:39:29,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 7 states have internal predecessors, (277), 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:39:29,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:29,949 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:29,959 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:39:30,150 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:39:30,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:39:30,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:30,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1777666526, now seen corresponding path program 2 times [2025-03-13 21:39:30,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:30,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941478639] [2025-03-13 21:39:30,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:30,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:39:30,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:30,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:30,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:30,308 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:39:30,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:30,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941478639] [2025-03-13 21:39:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941478639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:30,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778333047] [2025-03-13 21:39:30,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:30,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:30,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:30,311 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:39:30,312 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:39:30,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:39:30,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:30,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:30,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:30,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:39:30,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:30,414 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:39:30,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:30,459 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:39:30,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778333047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:30,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:30,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:39:30,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974717339] [2025-03-13 21:39:30,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:30,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:39:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:30,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:39:30,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:39:30,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 134 [2025-03-13 21:39:30,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 246 flow. Second operand has 13 states, 13 states have (on average 39.30769230769231) internal successors, (511), 13 states have internal predecessors, (511), 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:39:30,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:30,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 134 [2025-03-13 21:39:30,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:30,791 INFO L124 PetriNetUnfolderBase]: 803/2163 cut-off events. [2025-03-13 21:39:30,791 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 21:39:30,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 2163 events. 803/2163 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15714 event pairs, 666 based on Foata normal form. 6/1936 useless extension candidates. Maximal degree in co-relation 3657. Up to 1503 conditions per place. [2025-03-13 21:39:30,802 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 60 selfloop transitions, 11 changer transitions 0/109 dead transitions. [2025-03-13 21:39:30,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 424 flow [2025-03-13 21:39:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:39:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:39:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 533 transitions. [2025-03-13 21:39:30,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3314676616915423 [2025-03-13 21:39:30,809 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 246 flow. Second operand 12 states and 533 transitions. [2025-03-13 21:39:30,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 424 flow [2025-03-13 21:39:30,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 109 transitions, 410 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:30,813 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 316 flow [2025-03-13 21:39:30,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=316, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2025-03-13 21:39:30,814 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2025-03-13 21:39:30,814 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 316 flow [2025-03-13 21:39:30,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 39.30769230769231) internal successors, (511), 13 states have internal predecessors, (511), 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:39:30,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:30,815 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:30,821 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:39:31,015 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:39:31,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:39:31,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash -581177054, now seen corresponding path program 3 times [2025-03-13 21:39:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019434305] [2025-03-13 21:39:31,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:39:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:31,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-03-13 21:39:31,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:39:31,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-13 21:39:31,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:31,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:39:31,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:39:31,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:39:31,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:31,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:31,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:39:31,086 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:39:31,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 21:39:31,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-13 21:39:31,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-13 21:39:31,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-13 21:39:31,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-13 21:39:31,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:39:31,088 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-13 21:39:31,090 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:39:31,090 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:39:31,109 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:39:31,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 178 transitions, 372 flow [2025-03-13 21:39:31,130 INFO L124 PetriNetUnfolderBase]: 105/353 cut-off events. [2025-03-13 21:39:31,130 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 21:39:31,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 353 events. 105/353 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1899 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 220. Up to 12 conditions per place. [2025-03-13 21:39:31,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 178 transitions, 372 flow [2025-03-13 21:39:31,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 178 transitions, 372 flow [2025-03-13 21:39:31,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:39:31,136 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;@44390e10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:39:31,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:39:31,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:39:31,142 INFO L124 PetriNetUnfolderBase]: 14/87 cut-off events. [2025-03-13 21:39:31,142 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:39:31,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:31,142 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:31,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:39:31,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1419940207, now seen corresponding path program 1 times [2025-03-13 21:39:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521014847] [2025-03-13 21:39:31,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:31,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:39:31,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:39:31,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:31,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:31,185 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:39:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:31,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521014847] [2025-03-13 21:39:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521014847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:31,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:39:31,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:39:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304010176] [2025-03-13 21:39:31,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:31,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:31,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:31,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:39:31,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 178 [2025-03-13 21:39:31,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 178 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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:39:31,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:31,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 178 [2025-03-13 21:39:31,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:34,380 INFO L124 PetriNetUnfolderBase]: 30545/58198 cut-off events. [2025-03-13 21:39:34,381 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-13 21:39:34,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102127 conditions, 58198 events. 30545/58198 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 574755 event pairs, 26406 based on Foata normal form. 13178/64898 useless extension candidates. Maximal degree in co-relation 83061. Up to 43826 conditions per place. [2025-03-13 21:39:34,682 INFO L140 encePairwiseOnDemand]: 131/178 looper letters, 83 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2025-03-13 21:39:34,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 135 transitions, 456 flow [2025-03-13 21:39:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:39:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:39:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2025-03-13 21:39:34,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5243445692883895 [2025-03-13 21:39:34,683 INFO L175 Difference]: Start difference. First operand has 129 places, 178 transitions, 372 flow. Second operand 3 states and 280 transitions. [2025-03-13 21:39:34,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 135 transitions, 456 flow [2025-03-13 21:39:34,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 135 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:39:34,692 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 296 flow [2025-03-13 21:39:34,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2025-03-13 21:39:34,693 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 3 predicate places. [2025-03-13 21:39:34,693 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 296 flow [2025-03-13 21:39:34,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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:39:34,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:34,694 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:34,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:39:34,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:39:34,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash 413299545, now seen corresponding path program 1 times [2025-03-13 21:39:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33101574] [2025-03-13 21:39:34,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:34,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:39:34,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:34,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:34,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:34,757 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:39:34,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33101574] [2025-03-13 21:39:34,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33101574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24122043] [2025-03-13 21:39:34,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:34,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:34,761 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:39:34,762 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:39:34,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:39:34,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:34,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:34,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:34,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:39:34,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:34,854 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:39:34,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:34,865 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:39:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24122043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:34,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:39:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819880242] [2025-03-13 21:39:34,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:34,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:39:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:34,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:39:34,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:39:34,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 178 [2025-03-13 21:39:34,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 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:39:34,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:34,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 178 [2025-03-13 21:39:34,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:37,627 INFO L124 PetriNetUnfolderBase]: 30545/58201 cut-off events. [2025-03-13 21:39:37,627 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-13 21:39:37,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102143 conditions, 58201 events. 30545/58201 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 575076 event pairs, 26406 based on Foata normal form. 0/51723 useless extension candidates. Maximal degree in co-relation 102130. Up to 43826 conditions per place. [2025-03-13 21:39:37,893 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 83 selfloop transitions, 5 changer transitions 0/138 dead transitions. [2025-03-13 21:39:37,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 138 transitions, 484 flow [2025-03-13 21:39:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:39:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:39:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 391 transitions. [2025-03-13 21:39:37,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3661048689138577 [2025-03-13 21:39:37,895 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 296 flow. Second operand 6 states and 391 transitions. [2025-03-13 21:39:37,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 138 transitions, 484 flow [2025-03-13 21:39:37,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 480 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:37,899 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 328 flow [2025-03-13 21:39:37,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2025-03-13 21:39:37,899 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 10 predicate places. [2025-03-13 21:39:37,899 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 328 flow [2025-03-13 21:39:37,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 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:39:37,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:37,900 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:37,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:39:38,101 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:39:38,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:39:38,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1182841839, now seen corresponding path program 2 times [2025-03-13 21:39:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:38,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765897419] [2025-03-13 21:39:38,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:38,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-13 21:39:38,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:39:38,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:38,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:38,185 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:39:38,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:38,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765897419] [2025-03-13 21:39:38,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765897419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:38,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154072772] [2025-03-13 21:39:38,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:38,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:38,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:38,188 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:39:38,190 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:39:38,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-13 21:39:38,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:39:38,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:38,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:38,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:39:38,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:38,280 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:39:38,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:38,320 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:39:38,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154072772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:38,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:38,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:39:38,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156811961] [2025-03-13 21:39:38,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:38,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:39:38,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:38,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:39:38,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:39:38,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 178 [2025-03-13 21:39:38,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 328 flow. Second operand has 13 states, 13 states have (on average 51.38461538461539) internal successors, (668), 13 states have internal predecessors, (668), 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:39:38,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:38,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 178 [2025-03-13 21:39:38,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:41,525 INFO L124 PetriNetUnfolderBase]: 30545/58207 cut-off events. [2025-03-13 21:39:41,526 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-13 21:39:41,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102180 conditions, 58207 events. 30545/58207 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 575029 event pairs, 26406 based on Foata normal form. 6/51736 useless extension candidates. Maximal degree in co-relation 102121. Up to 43826 conditions per place. [2025-03-13 21:39:42,097 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 83 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2025-03-13 21:39:42,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 552 flow [2025-03-13 21:39:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:39:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:39:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 700 transitions. [2025-03-13 21:39:42,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32771535580524347 [2025-03-13 21:39:42,099 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 328 flow. Second operand 12 states and 700 transitions. [2025-03-13 21:39:42,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 552 flow [2025-03-13 21:39:42,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 538 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:42,103 INFO L231 Difference]: Finished difference. Result has 155 places, 144 transitions, 398 flow [2025-03-13 21:39:42,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=398, PETRI_PLACES=155, PETRI_TRANSITIONS=144} [2025-03-13 21:39:42,103 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 26 predicate places. [2025-03-13 21:39:42,103 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 144 transitions, 398 flow [2025-03-13 21:39:42,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.38461538461539) internal successors, (668), 13 states have internal predecessors, (668), 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:39:42,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:42,104 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:42,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:39:42,304 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:39:42,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:39:42,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1815043153, now seen corresponding path program 3 times [2025-03-13 21:39:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:42,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029541591] [2025-03-13 21:39:42,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:39:42,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:42,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-13 21:39:42,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:39:42,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-13 21:39:42,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:42,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:39:42,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:39:42,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:39:42,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:42,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:42,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:39:42,369 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:39:42,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-13 21:39:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-13 21:39:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-13 21:39:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-13 21:39:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-13 21:39:42,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-13 21:39:42,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:39:42,369 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-13 21:39:42,370 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:39:42,370 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:39:42,392 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:39:42,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 222 transitions, 471 flow [2025-03-13 21:39:42,415 INFO L124 PetriNetUnfolderBase]: 148/499 cut-off events. [2025-03-13 21:39:42,415 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 21:39:42,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 499 events. 148/499 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2817 event pairs, 1 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 362. Up to 16 conditions per place. [2025-03-13 21:39:42,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 222 transitions, 471 flow [2025-03-13 21:39:42,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 222 transitions, 471 flow [2025-03-13 21:39:42,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:39:42,422 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;@44390e10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:39:42,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 21:39:42,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:39:42,427 INFO L124 PetriNetUnfolderBase]: 23/122 cut-off events. [2025-03-13 21:39:42,427 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:39:42,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:42,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:42,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:39:42,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash -285465829, now seen corresponding path program 1 times [2025-03-13 21:39:42,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:42,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592737472] [2025-03-13 21:39:42,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:42,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:42,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:39:42,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:39:42,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:42,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:42,464 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:39:42,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:42,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592737472] [2025-03-13 21:39:42,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592737472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:42,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:39:42,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:39:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110007317] [2025-03-13 21:39:42,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:42,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:42,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:42,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:39:42,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 222 [2025-03-13 21:39:42,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 222 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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:39:42,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:42,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 222 [2025-03-13 21:39:42,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand