./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:35:21,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:35:21,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:35:21,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:35:21,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:35:21,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:35:21,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:35:21,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:35:21,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:35:21,771 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:35:21,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:35:21,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:35:21,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:35:21,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:35:21,772 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:35:21,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:35:21,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:35:21,773 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:35:21,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:35:21,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:35:21,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:35:21,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:35:21,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:35:21,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:35:21,773 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:35:21,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:35:21,774 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:35:21,774 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:35:21,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:35:21,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:35:21,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:35:21,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:35:21,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:35:21,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:35:21,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:35:21,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:35:21,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:35:21,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:35:21,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:35:21,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:35:21,775 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:35:21,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:35:21,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:35:21,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:35:21,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:35:21,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:35:21,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:35:21,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:35:21,776 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-01-09 16:35:22,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:35:22,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:35:22,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:35:22,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:35:22,022 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:35:22,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-01-09 16:35:23,161 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30fc1b29c/78694a80b5fc4891b40c0945faa03db8/FLAG0cbeefc47 [2025-01-09 16:35:23,457 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:35:23,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-01-09 16:35:23,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30fc1b29c/78694a80b5fc4891b40c0945faa03db8/FLAG0cbeefc47 [2025-01-09 16:35:23,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30fc1b29c/78694a80b5fc4891b40c0945faa03db8 [2025-01-09 16:35:23,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:35:23,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:35:23,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:35:23,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:35:23,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:35:23,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:23" (1/1) ... [2025-01-09 16:35:23,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d0155c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:23, skipping insertion in model container [2025-01-09 16:35:23,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:23" (1/1) ... [2025-01-09 16:35:23,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:35:23,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2025-01-09 16:35:24,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:35:24,061 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:35:24,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2025-01-09 16:35:24,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:35:24,155 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:35:24,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24 WrapperNode [2025-01-09 16:35:24,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:35:24,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:35:24,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:35:24,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:35:24,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,187 INFO L138 Inliner]: procedures = 272, calls = 109, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 314 [2025-01-09 16:35:24,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:35:24,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:35:24,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:35:24,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:35:24,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,212 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 75, 2, 5]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 60, 0, 5]. The 7 writes are split as follows [0, 6, 1, 0]. [2025-01-09 16:35:24,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:35:24,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:35:24,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:35:24,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:35:24,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:35:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:24,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:35:24,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:35:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 16:35:24,282 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:35:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:35:24,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:35:24,284 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:35:24,413 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:35:24,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:35:24,744 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:35:24,745 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:35:25,045 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:35:25,045 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-09 16:35:25,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:35:25 BoogieIcfgContainer [2025-01-09 16:35:25,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:35:25,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:35:25,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:35:25,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:35:25,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:35:23" (1/3) ... [2025-01-09 16:35:25,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b999b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:35:25, skipping insertion in model container [2025-01-09 16:35:25,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24" (2/3) ... [2025-01-09 16:35:25,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b999b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:35:25, skipping insertion in model container [2025-01-09 16:35:25,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:35:25" (3/3) ... [2025-01-09 16:35:25,052 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-01-09 16:35:25,064 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:35:25,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 97 locations, 1 initial locations, 20 loop locations, and 3 error locations. [2025-01-09 16:35:25,066 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:35:25,109 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 16:35:25,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 137 transitions, 281 flow [2025-01-09 16:35:25,194 INFO L124 PetriNetUnfolderBase]: 65/223 cut-off events. [2025-01-09 16:35:25,197 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:35:25,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 223 events. 65/223 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1043 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2025-01-09 16:35:25,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 137 transitions, 281 flow [2025-01-09 16:35:25,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 135 transitions, 274 flow [2025-01-09 16:35:25,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:35:25,226 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;@3048e103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:35:25,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:35:25,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:35:25,236 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-01-09 16:35:25,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:35:25,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:25,237 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 16:35:25,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:35:25,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2129743704, now seen corresponding path program 1 times [2025-01-09 16:35:25,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:25,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348963562] [2025-01-09 16:35:25,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:25,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:25,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:35:25,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:35:25,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:25,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:25,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348963562] [2025-01-09 16:35:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348963562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:25,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:25,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:35:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597980056] [2025-01-09 16:35:25,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:25,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:35:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:25,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:35:25,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:35:25,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 137 [2025-01-09 16:35:25,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 135 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:25,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:25,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 137 [2025-01-09 16:35:25,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:25,897 INFO L124 PetriNetUnfolderBase]: 803/2205 cut-off events. [2025-01-09 16:35:25,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:35:25,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 2205 events. 803/2205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 16378 event pairs, 666 based on Foata normal form. 534/2503 useless extension candidates. Maximal degree in co-relation 3597. Up to 1505 conditions per place. [2025-01-09 16:35:25,915 INFO L140 encePairwiseOnDemand]: 101/137 looper letters, 60 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2025-01-09 16:35:25,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 103 transitions, 334 flow [2025-01-09 16:35:25,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:35:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:35:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2025-01-09 16:35:25,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5328467153284672 [2025-01-09 16:35:25,928 INFO L175 Difference]: Start difference. First operand has 99 places, 135 transitions, 274 flow. Second operand 3 states and 219 transitions. [2025-01-09 16:35:25,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 103 transitions, 334 flow [2025-01-09 16:35:25,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:35:25,937 INFO L231 Difference]: Finished difference. Result has 102 places, 103 transitions, 220 flow [2025-01-09 16:35:25,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=103} [2025-01-09 16:35:25,946 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 3 predicate places. [2025-01-09 16:35:25,946 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 103 transitions, 220 flow [2025-01-09 16:35:25,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:25,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:25,946 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:25,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:35:25,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:35:25,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1350263058, now seen corresponding path program 1 times [2025-01-09 16:35:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:25,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682861689] [2025-01-09 16:35:25,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:25,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:35:25,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:35:25,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:25,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:26,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:26,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682861689] [2025-01-09 16:35:26,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682861689] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:26,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523014589] [2025-01-09 16:35:26,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:26,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:26,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:26,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:35:26,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:35:26,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:35:26,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:35:26,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:26,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:26,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:35:26,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:26,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:26,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523014589] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:26,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:26,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:35:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881968260] [2025-01-09 16:35:26,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:26,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:35:26,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:26,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:35:26,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:35:26,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 137 [2025-01-09 16:35:26,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 42.57142857142857) internal successors, (298), 7 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:26,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:26,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 137 [2025-01-09 16:35:26,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:26,509 INFO L124 PetriNetUnfolderBase]: 803/2208 cut-off events. [2025-01-09 16:35:26,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:35:26,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 2208 events. 803/2208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16365 event pairs, 666 based on Foata normal form. 0/1972 useless extension candidates. Maximal degree in co-relation 3719. Up to 1505 conditions per place. [2025-01-09 16:35:26,516 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 60 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-01-09 16:35:26,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 106 transitions, 362 flow [2025-01-09 16:35:26,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:35:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:35:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 314 transitions. [2025-01-09 16:35:26,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3819951338199513 [2025-01-09 16:35:26,519 INFO L175 Difference]: Start difference. First operand has 102 places, 103 transitions, 220 flow. Second operand 6 states and 314 transitions. [2025-01-09 16:35:26,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 106 transitions, 362 flow [2025-01-09 16:35:26,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 106 transitions, 358 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:26,522 INFO L231 Difference]: Finished difference. Result has 109 places, 106 transitions, 252 flow [2025-01-09 16:35:26,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=109, PETRI_TRANSITIONS=106} [2025-01-09 16:35:26,524 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 10 predicate places. [2025-01-09 16:35:26,524 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 106 transitions, 252 flow [2025-01-09 16:35:26,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.57142857142857) internal successors, (298), 7 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:26,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:26,524 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:26,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:35:26,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:26,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:35:26,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1715147304, now seen corresponding path program 2 times [2025-01-09 16:35:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946468562] [2025-01-09 16:35:26,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:26,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 16:35:26,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:26,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:26,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:26,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:26,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946468562] [2025-01-09 16:35:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946468562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:26,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829797083] [2025-01-09 16:35:26,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:26,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:26,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:26,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:35:26,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:35:26,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 16:35:26,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:26,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:26,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:26,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:35:26,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:27,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829797083] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:27,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-09 16:35:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003375902] [2025-01-09 16:35:27,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:27,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:35:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:27,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:35:27,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:35:27,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 137 [2025-01-09 16:35:27,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 252 flow. Second operand has 13 states, 13 states have (on average 42.30769230769231) internal successors, (550), 13 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:27,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:27,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 137 [2025-01-09 16:35:27,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:27,395 INFO L124 PetriNetUnfolderBase]: 803/2214 cut-off events. [2025-01-09 16:35:27,395 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 16:35:27,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 2214 events. 803/2214 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16381 event pairs, 666 based on Foata normal form. 6/1985 useless extension candidates. Maximal degree in co-relation 3710. Up to 1505 conditions per place. [2025-01-09 16:35:27,404 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 60 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2025-01-09 16:35:27,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 112 transitions, 430 flow [2025-01-09 16:35:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:35:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:35:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 569 transitions. [2025-01-09 16:35:27,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34610705596107055 [2025-01-09 16:35:27,407 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 252 flow. Second operand 12 states and 569 transitions. [2025-01-09 16:35:27,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 112 transitions, 430 flow [2025-01-09 16:35:27,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 112 transitions, 416 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:27,410 INFO L231 Difference]: Finished difference. Result has 125 places, 112 transitions, 322 flow [2025-01-09 16:35:27,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=322, PETRI_PLACES=125, PETRI_TRANSITIONS=112} [2025-01-09 16:35:27,410 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 26 predicate places. [2025-01-09 16:35:27,410 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 112 transitions, 322 flow [2025-01-09 16:35:27,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 42.30769230769231) internal successors, (550), 13 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:27,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:27,411 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:27,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:35:27,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:27,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:35:27,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1625047960, now seen corresponding path program 3 times [2025-01-09 16:35:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124877595] [2025-01-09 16:35:27,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:35:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:27,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-01-09 16:35:27,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:35:27,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:35:27,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:27,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:35:27,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:35:27,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:35:27,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:27,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:27,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:35:27,701 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:35:27,702 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:35:27,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:35:27,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:35:27,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:35:27,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:35:27,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:35:27,708 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-01-09 16:35:27,711 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:35:27,711 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:35:27,733 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:35:27,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 182 transitions, 380 flow [2025-01-09 16:35:27,756 INFO L124 PetriNetUnfolderBase]: 105/361 cut-off events. [2025-01-09 16:35:27,757 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:35:27,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 361 events. 105/361 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1931 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 225. Up to 12 conditions per place. [2025-01-09 16:35:27,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 182 transitions, 380 flow [2025-01-09 16:35:27,763 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 182 transitions, 380 flow [2025-01-09 16:35:27,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:35:27,766 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;@3048e103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:35:27,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:35:27,775 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:35:27,775 INFO L124 PetriNetUnfolderBase]: 10/65 cut-off events. [2025-01-09 16:35:27,776 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:35:27,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:27,776 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:27,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-09 16:35:27,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash 568016667, now seen corresponding path program 1 times [2025-01-09 16:35:27,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:27,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400396763] [2025-01-09 16:35:27,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:27,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:27,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:35:27,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:35:27,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:27,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:27,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:27,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400396763] [2025-01-09 16:35:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400396763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:27,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:35:27,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983317332] [2025-01-09 16:35:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:27,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:35:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:27,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:35:27,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:35:27,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 182 [2025-01-09 16:35:27,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 182 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:27,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:27,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 182 [2025-01-09 16:35:27,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:31,031 INFO L124 PetriNetUnfolderBase]: 30545/58859 cut-off events. [2025-01-09 16:35:31,031 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-01-09 16:35:31,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102897 conditions, 58859 events. 30545/58859 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1751. Compared 590422 event pairs, 26406 based on Foata normal form. 15618/67995 useless extension candidates. Maximal degree in co-relation 83702. Up to 43935 conditions per place. [2025-01-09 16:35:31,327 INFO L140 encePairwiseOnDemand]: 135/182 looper letters, 83 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2025-01-09 16:35:31,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 139 transitions, 464 flow [2025-01-09 16:35:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:35:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:35:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-01-09 16:35:31,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5347985347985348 [2025-01-09 16:35:31,329 INFO L175 Difference]: Start difference. First operand has 133 places, 182 transitions, 380 flow. Second operand 3 states and 292 transitions. [2025-01-09 16:35:31,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 139 transitions, 464 flow [2025-01-09 16:35:31,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 139 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:35:31,333 INFO L231 Difference]: Finished difference. Result has 136 places, 139 transitions, 304 flow [2025-01-09 16:35:31,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=136, PETRI_TRANSITIONS=139} [2025-01-09 16:35:31,337 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 3 predicate places. [2025-01-09 16:35:31,337 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 139 transitions, 304 flow [2025-01-09 16:35:31,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:31,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:31,337 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:31,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:35:31,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-09 16:35:31,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1320628311, now seen corresponding path program 1 times [2025-01-09 16:35:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328569637] [2025-01-09 16:35:31,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:31,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:31,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:35:31,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:31,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:31,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:31,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328569637] [2025-01-09 16:35:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328569637] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140809852] [2025-01-09 16:35:31,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:31,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:31,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:31,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:35:31,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:35:31,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:35:31,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:31,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:31,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:31,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:35:31,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:31,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140809852] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:31,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:31,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:35:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150124942] [2025-01-09 16:35:31,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:35:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:31,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:35:31,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:35:31,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 182 [2025-01-09 16:35:31,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 139 transitions, 304 flow. Second operand has 7 states, 7 states have (on average 55.714285714285715) internal successors, (390), 7 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:31,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:31,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 182 [2025-01-09 16:35:31,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:34,455 INFO L124 PetriNetUnfolderBase]: 30545/58862 cut-off events. [2025-01-09 16:35:34,456 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-01-09 16:35:34,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102913 conditions, 58862 events. 30545/58862 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1758. Compared 590368 event pairs, 26406 based on Foata normal form. 0/52380 useless extension candidates. Maximal degree in co-relation 102900. Up to 43935 conditions per place. [2025-01-09 16:35:34,724 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 83 selfloop transitions, 5 changer transitions 0/142 dead transitions. [2025-01-09 16:35:34,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 142 transitions, 492 flow [2025-01-09 16:35:34,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:35:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:35:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 415 transitions. [2025-01-09 16:35:34,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38003663003663 [2025-01-09 16:35:34,725 INFO L175 Difference]: Start difference. First operand has 136 places, 139 transitions, 304 flow. Second operand 6 states and 415 transitions. [2025-01-09 16:35:34,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 142 transitions, 492 flow [2025-01-09 16:35:34,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 488 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:34,728 INFO L231 Difference]: Finished difference. Result has 143 places, 142 transitions, 336 flow [2025-01-09 16:35:34,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=143, PETRI_TRANSITIONS=142} [2025-01-09 16:35:34,729 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 10 predicate places. [2025-01-09 16:35:34,729 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 142 transitions, 336 flow [2025-01-09 16:35:34,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.714285714285715) internal successors, (390), 7 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:34,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:34,730 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:34,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:35:34,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:34,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-09 16:35:34,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1911270939, now seen corresponding path program 2 times [2025-01-09 16:35:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:34,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844462420] [2025-01-09 16:35:34,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:34,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:34,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 16:35:34,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:35:34,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:34,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:35,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:35,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844462420] [2025-01-09 16:35:35,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844462420] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:35,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98733335] [2025-01-09 16:35:35,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:35,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:35,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:35,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:35:35,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:35:35,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 16:35:35,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:35:35,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:35,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:35,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:35:35,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:35,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:35,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98733335] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:35,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:35,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-09 16:35:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519586350] [2025-01-09 16:35:35,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:35,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:35:35,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:35,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:35:35,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:35:35,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 182 [2025-01-09 16:35:35,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 142 transitions, 336 flow. Second operand has 13 states, 13 states have (on average 55.38461538461539) internal successors, (720), 13 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:35,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:35,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 182 [2025-01-09 16:35:35,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:38,452 INFO L124 PetriNetUnfolderBase]: 30545/58868 cut-off events. [2025-01-09 16:35:38,452 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-01-09 16:35:38,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102950 conditions, 58868 events. 30545/58868 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 1758. Compared 590397 event pairs, 26406 based on Foata normal form. 6/52393 useless extension candidates. Maximal degree in co-relation 102891. Up to 43935 conditions per place. [2025-01-09 16:35:38,831 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 83 selfloop transitions, 11 changer transitions 0/148 dead transitions. [2025-01-09 16:35:38,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 148 transitions, 560 flow [2025-01-09 16:35:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:35:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:35:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 748 transitions. [2025-01-09 16:35:38,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3424908424908425 [2025-01-09 16:35:38,837 INFO L175 Difference]: Start difference. First operand has 143 places, 142 transitions, 336 flow. Second operand 12 states and 748 transitions. [2025-01-09 16:35:38,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 148 transitions, 560 flow [2025-01-09 16:35:38,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 148 transitions, 546 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:38,841 INFO L231 Difference]: Finished difference. Result has 159 places, 148 transitions, 406 flow [2025-01-09 16:35:38,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=406, PETRI_PLACES=159, PETRI_TRANSITIONS=148} [2025-01-09 16:35:38,842 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 26 predicate places. [2025-01-09 16:35:38,843 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 148 transitions, 406 flow [2025-01-09 16:35:38,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 55.38461538461539) internal successors, (720), 13 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:38,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:38,843 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:38,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:35:39,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 16:35:39,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-09 16:35:39,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash 583746715, now seen corresponding path program 3 times [2025-01-09 16:35:39,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:39,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215540477] [2025-01-09 16:35:39,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:35:39,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:39,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-01-09 16:35:39,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:35:39,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:35:39,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:39,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:35:39,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:35:39,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:35:39,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:39,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:39,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:35:39,121 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:35:39,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-09 16:35:39,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-01-09 16:35:39,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-01-09 16:35:39,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-01-09 16:35:39,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-01-09 16:35:39,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:35:39,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:35:39,122 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-01-09 16:35:39,122 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:35:39,122 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:35:39,142 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:35:39,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 227 transitions, 481 flow [2025-01-09 16:35:39,166 INFO L124 PetriNetUnfolderBase]: 148/510 cut-off events. [2025-01-09 16:35:39,167 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 16:35:39,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 510 events. 148/510 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2906 event pairs, 1 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 370. Up to 16 conditions per place. [2025-01-09 16:35:39,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 227 transitions, 481 flow [2025-01-09 16:35:39,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 227 transitions, 481 flow [2025-01-09 16:35:39,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:35:39,178 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;@3048e103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:35:39,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:35:39,184 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:35:39,185 INFO L124 PetriNetUnfolderBase]: 25/139 cut-off events. [2025-01-09 16:35:39,185 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:35:39,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:39,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:39,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:35:39,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:39,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1956616968, now seen corresponding path program 1 times [2025-01-09 16:35:39,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:39,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289786485] [2025-01-09 16:35:39,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:39,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:35:39,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:35:39,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:39,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289786485] [2025-01-09 16:35:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289786485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:39,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:39,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:35:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469021674] [2025-01-09 16:35:39,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:39,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:35:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:39,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:35:39,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:35:39,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 227 [2025-01-09 16:35:39,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 227 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:39,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:39,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 227 [2025-01-09 16:35:39,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand