./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_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_71-funloop_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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:35:21,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:35:21,996 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:22,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:35:22,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:35:22,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:35:22,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:35:22,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:35:22,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:35:22,027 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:35:22,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:35:22,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:35:22,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:35:22,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:35:22,028 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:35:22,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:35:22,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:35:22,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:35:22,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:35:22,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:35:22,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:35:22,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:35:22,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:35:22,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:35:22,029 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:35:22,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:35:22,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:35:22,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:35:22,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:35:22,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:35:22,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:35:22,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:35:22,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:35:22,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:35:22,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:35:22,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:35:22,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:35:22,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:35:22,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:35:22,032 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2025-01-09 16:35:22,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:35:22,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:35:22,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:35:22,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:35:22,318 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:35:22,319 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_71-funloop_racing.i [2025-01-09 16:35:23,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9086253c/cbf9890bb814447d92c6a8b9b80f9a8f/FLAGae5f00d2f [2025-01-09 16:35:24,025 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:35:24,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-01-09 16:35:24,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9086253c/cbf9890bb814447d92c6a8b9b80f9a8f/FLAGae5f00d2f [2025-01-09 16:35:24,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9086253c/cbf9890bb814447d92c6a8b9b80f9a8f [2025-01-09 16:35:24,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:35:24,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:35:24,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:35:24,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:35:24,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:35:24,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d912b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:24, skipping insertion in model container [2025-01-09 16:35:24,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:24" (1/1) ... [2025-01-09 16:35:24,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:35:24,420 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_71-funloop_racing.i[41323,41336] [2025-01-09 16:35:24,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:35:24,458 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:35:24,496 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_71-funloop_racing.i[41323,41336] [2025-01-09 16:35:24,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:35:24,559 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:35:24,561 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,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:35:24,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:35:24,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:35:24,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:35:24,566 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,582 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,610 INFO L138 Inliner]: procedures = 272, calls = 107, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 308 [2025-01-09 16:35:24,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:35:24,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:35:24,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:35:24,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:35:24,619 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,620 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,625 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,635 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 75, 5, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 60, 5, 0]. The 7 writes are split as follows [0, 6, 0, 1]. [2025-01-09 16:35:24,635 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,635 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,644 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,645 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,651 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,652 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,656 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,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:35:24,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:35:24,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:35:24,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:35:24,663 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,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:35:24,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:24,689 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,693 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,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 16:35:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 16:35:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:35:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:35:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 16:35:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:35:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:35:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:35:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:35:24,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:35:24,711 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,833 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:35:24,834 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:35:25,188 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:35:25,188 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:35:25,634 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:35:25,634 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-09 16:35:25,634 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,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:35:25,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:35:25,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:35:25,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:35:25,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:35:24" (1/3) ... [2025-01-09 16:35:25,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bccd646 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,649 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,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bccd646 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,649 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,650 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-01-09 16:35:25,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:35:25,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 94 locations, 1 initial locations, 20 loop locations, and 3 error locations. [2025-01-09 16:35:25,678 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:35:25,717 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 16:35:25,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 134 transitions, 275 flow [2025-01-09 16:35:25,788 INFO L124 PetriNetUnfolderBase]: 65/217 cut-off events. [2025-01-09 16:35:25,790 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:35:25,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 217 events. 65/217 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1018 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2025-01-09 16:35:25,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 134 transitions, 275 flow [2025-01-09 16:35:25,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 132 transitions, 268 flow [2025-01-09 16:35:25,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:35:25,812 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;@3f6cfa5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:35:25,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:35:25,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:35:25,827 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2025-01-09 16:35:25,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:35:25,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:25,828 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 16:35:25,829 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,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1693792360, now seen corresponding path program 1 times [2025-01-09 16:35:25,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:25,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571745746] [2025-01-09 16:35:25,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:25,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:35:25,953 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,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:25,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:26,116 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:26,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:26,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571745746] [2025-01-09 16:35:26,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571745746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:26,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:26,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:35:26,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711298385] [2025-01-09 16:35:26,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:26,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:35:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:26,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:35:26,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:35:26,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 134 [2025-01-09 16:35:26,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 132 transitions, 268 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:26,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:26,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 134 [2025-01-09 16:35:26,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:26,472 INFO L124 PetriNetUnfolderBase]: 753/2084 cut-off events. [2025-01-09 16:35:26,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:35:26,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 2084 events. 753/2084 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15507 event pairs, 612 based on Foata normal form. 517/2365 useless extension candidates. Maximal degree in co-relation 3375. Up to 1398 conditions per place. [2025-01-09 16:35:26,491 INFO L140 encePairwiseOnDemand]: 98/134 looper letters, 57 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-01-09 16:35:26,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 100 transitions, 322 flow [2025-01-09 16:35:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:35:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:35:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2025-01-09 16:35:26,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5373134328358209 [2025-01-09 16:35:26,502 INFO L175 Difference]: Start difference. First operand has 96 places, 132 transitions, 268 flow. Second operand 3 states and 216 transitions. [2025-01-09 16:35:26,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 100 transitions, 322 flow [2025-01-09 16:35:26,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 100 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:35:26,511 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 214 flow [2025-01-09 16:35:26,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2025-01-09 16:35:26,515 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 3 predicate places. [2025-01-09 16:35:26,516 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 214 flow [2025-01-09 16:35:26,516 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:26,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:26,516 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:35:26,516 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:26,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash -8615150, now seen corresponding path program 1 times [2025-01-09 16:35:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:26,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948221919] [2025-01-09 16:35:26,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:26,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:35:26,532 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,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:26,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:26,595 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,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:26,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948221919] [2025-01-09 16:35:26,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948221919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:26,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583458271] [2025-01-09 16:35:26,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:26,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:26,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:26,598 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,599 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,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:35:26,671 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,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:26,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:26,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:35:26,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:26,697 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,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:26,713 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,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583458271] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:26,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:26,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:35:26,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580038945] [2025-01-09 16:35:26,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:26,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:35:26,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:26,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:35:26,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:35:26,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 134 [2025-01-09 16:35:26,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 214 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,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:26,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 134 [2025-01-09 16:35:26,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:27,068 INFO L124 PetriNetUnfolderBase]: 753/2087 cut-off events. [2025-01-09 16:35:27,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:35:27,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 2087 events. 753/2087 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15509 event pairs, 612 based on Foata normal form. 0/1851 useless extension candidates. Maximal degree in co-relation 3491. Up to 1398 conditions per place. [2025-01-09 16:35:27,080 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 57 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-01-09 16:35:27,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 103 transitions, 350 flow [2025-01-09 16:35:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:35:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:35:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 311 transitions. [2025-01-09 16:35:27,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38681592039800994 [2025-01-09 16:35:27,084 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 214 flow. Second operand 6 states and 311 transitions. [2025-01-09 16:35:27,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 103 transitions, 350 flow [2025-01-09 16:35:27,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 103 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:27,087 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 246 flow [2025-01-09 16:35:27,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2025-01-09 16:35:27,088 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2025-01-09 16:35:27,088 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 246 flow [2025-01-09 16:35:27,088 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:27,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:27,088 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:27,096 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:27,293 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:27,293 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:27,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash 186439192, now seen corresponding path program 2 times [2025-01-09 16:35:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043999151] [2025-01-09 16:35:27,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:27,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 16:35:27,320 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:27,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:27,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:27,404 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,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043999151] [2025-01-09 16:35:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043999151] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403352514] [2025-01-09 16:35:27,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:27,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:27,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:27,410 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:27,411 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:27,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 16:35:27,501 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:27,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:27,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:35:27,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:27,516 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,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:27,563 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,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403352514] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:27,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-09 16:35:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933537515] [2025-01-09 16:35:27,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:27,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:35:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:27,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:35:27,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:35:27,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 134 [2025-01-09 16:35:27,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 246 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,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:27,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 134 [2025-01-09 16:35:27,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:27,935 INFO L124 PetriNetUnfolderBase]: 753/2093 cut-off events. [2025-01-09 16:35:27,935 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 16:35:27,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 2093 events. 753/2093 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15503 event pairs, 612 based on Foata normal form. 6/1864 useless extension candidates. Maximal degree in co-relation 3482. Up to 1398 conditions per place. [2025-01-09 16:35:27,949 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 57 selfloop transitions, 11 changer transitions 0/109 dead transitions. [2025-01-09 16:35:27,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 418 flow [2025-01-09 16:35:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:35:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:35:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 566 transitions. [2025-01-09 16:35:27,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35199004975124376 [2025-01-09 16:35:27,952 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 246 flow. Second operand 12 states and 566 transitions. [2025-01-09 16:35:27,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 418 flow [2025-01-09 16:35:27,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 109 transitions, 404 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:27,956 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 316 flow [2025-01-09 16:35:27,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=316, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2025-01-09 16:35:27,957 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2025-01-09 16:35:27,957 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 316 flow [2025-01-09 16:35:27,957 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,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:27,957 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:27,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:35:28,158 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:28,159 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:28,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2114399272, now seen corresponding path program 3 times [2025-01-09 16:35:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562190602] [2025-01-09 16:35:28,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:35:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:28,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-01-09 16:35:28,235 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:28,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:35:28,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:28,235 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:35:28,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:35:28,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:35:28,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:28,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:28,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:35:28,275 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:35:28,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:35:28,277 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:35:28,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:35:28,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:35:28,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:35:28,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:35:28,279 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-01-09 16:35:28,281 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:35:28,281 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:35:28,308 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:35:28,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 179 transitions, 374 flow [2025-01-09 16:35:28,339 INFO L124 PetriNetUnfolderBase]: 105/352 cut-off events. [2025-01-09 16:35:28,339 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:35:28,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 352 events. 105/352 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1899 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 219. Up to 12 conditions per place. [2025-01-09 16:35:28,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 179 transitions, 374 flow [2025-01-09 16:35:28,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 179 transitions, 374 flow [2025-01-09 16:35:28,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:35:28,348 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;@3f6cfa5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:35:28,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:35:28,354 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:35:28,354 INFO L124 PetriNetUnfolderBase]: 12/73 cut-off events. [2025-01-09 16:35:28,355 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:35:28,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:28,355 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:28,355 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:28,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1535071700, now seen corresponding path program 1 times [2025-01-09 16:35:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:28,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449986392] [2025-01-09 16:35:28,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:28,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:35:28,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:35:28,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:28,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:28,439 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:28,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:28,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449986392] [2025-01-09 16:35:28,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449986392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:28,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:28,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:35:28,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710132116] [2025-01-09 16:35:28,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:28,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:35:28,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:28,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:35:28,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:35:28,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 179 [2025-01-09 16:35:28,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 179 transitions, 374 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:28,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:28,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 179 [2025-01-09 16:35:28,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:31,991 INFO L124 PetriNetUnfolderBase]: 28513/55596 cut-off events. [2025-01-09 16:35:31,991 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-01-09 16:35:32,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96433 conditions, 55596 events. 28513/55596 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 1784. Compared 563548 event pairs, 24301 based on Foata normal form. 14750/63849 useless extension candidates. Maximal degree in co-relation 78420. Up to 40734 conditions per place. [2025-01-09 16:35:32,209 INFO L140 encePairwiseOnDemand]: 132/179 looper letters, 80 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2025-01-09 16:35:32,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 136 transitions, 452 flow [2025-01-09 16:35:32,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:35:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:35:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2025-01-09 16:35:32,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5381750465549349 [2025-01-09 16:35:32,215 INFO L175 Difference]: Start difference. First operand has 130 places, 179 transitions, 374 flow. Second operand 3 states and 289 transitions. [2025-01-09 16:35:32,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 136 transitions, 452 flow [2025-01-09 16:35:32,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 136 transitions, 452 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:35:32,218 INFO L231 Difference]: Finished difference. Result has 133 places, 136 transitions, 298 flow [2025-01-09 16:35:32,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=133, PETRI_TRANSITIONS=136} [2025-01-09 16:35:32,219 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-01-09 16:35:32,219 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 136 transitions, 298 flow [2025-01-09 16:35:32,219 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:32,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:32,219 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:32,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:35:32,219 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:32,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1825277595, now seen corresponding path program 1 times [2025-01-09 16:35:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:32,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812455592] [2025-01-09 16:35:32,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:32,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:35:32,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:32,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:32,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:32,279 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:32,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:32,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812455592] [2025-01-09 16:35:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812455592] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:32,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706852616] [2025-01-09 16:35:32,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:32,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:32,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:32,286 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:32,287 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:32,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:35:32,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:32,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:32,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:32,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:35:32,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:32,375 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:32,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:32,390 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:32,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706852616] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:32,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:32,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:35:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447225501] [2025-01-09 16:35:32,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:32,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:35:32,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:32,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:35:32,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:35:32,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 179 [2025-01-09 16:35:32,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 136 transitions, 298 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:32,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:32,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 179 [2025-01-09 16:35:32,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:35,487 INFO L124 PetriNetUnfolderBase]: 28513/55599 cut-off events. [2025-01-09 16:35:35,487 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-01-09 16:35:35,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96449 conditions, 55599 events. 28513/55599 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 1774. Compared 563536 event pairs, 24301 based on Foata normal form. 0/49102 useless extension candidates. Maximal degree in co-relation 96436. Up to 40734 conditions per place. [2025-01-09 16:35:35,734 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 80 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-01-09 16:35:35,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 139 transitions, 480 flow [2025-01-09 16:35:35,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:35:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:35:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2025-01-09 16:35:35,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38361266294227186 [2025-01-09 16:35:35,737 INFO L175 Difference]: Start difference. First operand has 133 places, 136 transitions, 298 flow. Second operand 6 states and 412 transitions. [2025-01-09 16:35:35,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 139 transitions, 480 flow [2025-01-09 16:35:35,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 139 transitions, 476 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:35,742 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 330 flow [2025-01-09 16:35:35,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2025-01-09 16:35:35,743 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 10 predicate places. [2025-01-09 16:35:35,744 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 330 flow [2025-01-09 16:35:35,744 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:35,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:35,745 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:35,755 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:35,946 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:35,947 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:35,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1701367700, now seen corresponding path program 2 times [2025-01-09 16:35:35,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463148012] [2025-01-09 16:35:35,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:35,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 16:35:35,978 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,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:35,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:36,050 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:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:36,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463148012] [2025-01-09 16:35:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463148012] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:36,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284979043] [2025-01-09 16:35:36,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:36,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:36,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:36,053 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:36,054 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:36,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 16:35:36,143 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:36,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:36,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:36,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:35:36,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:36,158 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:36,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:36,198 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:36,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284979043] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:36,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:36,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-09 16:35:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537842827] [2025-01-09 16:35:36,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:36,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:35:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:36,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:35:36,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:35:36,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 179 [2025-01-09 16:35:36,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 330 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:36,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:36,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 179 [2025-01-09 16:35:36,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:39,796 INFO L124 PetriNetUnfolderBase]: 28513/55605 cut-off events. [2025-01-09 16:35:39,796 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-01-09 16:35:39,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96486 conditions, 55605 events. 28513/55605 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 1774. Compared 563706 event pairs, 24301 based on Foata normal form. 6/49115 useless extension candidates. Maximal degree in co-relation 96427. Up to 40734 conditions per place. [2025-01-09 16:35:40,160 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 80 selfloop transitions, 11 changer transitions 0/145 dead transitions. [2025-01-09 16:35:40,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 145 transitions, 548 flow [2025-01-09 16:35:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:35:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:35:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 745 transitions. [2025-01-09 16:35:40,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3468342644320298 [2025-01-09 16:35:40,165 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 330 flow. Second operand 12 states and 745 transitions. [2025-01-09 16:35:40,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 145 transitions, 548 flow [2025-01-09 16:35:40,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 145 transitions, 534 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:40,169 INFO L231 Difference]: Finished difference. Result has 156 places, 145 transitions, 400 flow [2025-01-09 16:35:40,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=400, PETRI_PLACES=156, PETRI_TRANSITIONS=145} [2025-01-09 16:35:40,170 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 26 predicate places. [2025-01-09 16:35:40,170 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 145 transitions, 400 flow [2025-01-09 16:35:40,170 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:40,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:40,171 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:40,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:35:40,371 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:40,372 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:40,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1884201524, now seen corresponding path program 3 times [2025-01-09 16:35:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:40,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711932110] [2025-01-09 16:35:40,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:35:40,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:40,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-01-09 16:35:40,429 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:40,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:35:40,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:40,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:35:40,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:35:40,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:35:40,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:40,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:40,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:35:40,468 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:35:40,468 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-09 16:35:40,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-01-09 16:35:40,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-01-09 16:35:40,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-01-09 16:35:40,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-01-09 16:35:40,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:35:40,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:35:40,469 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-01-09 16:35:40,470 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:35:40,470 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:35:40,513 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:35:40,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 224 transitions, 475 flow [2025-01-09 16:35:40,543 INFO L124 PetriNetUnfolderBase]: 148/498 cut-off events. [2025-01-09 16:35:40,543 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 16:35:40,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 498 events. 148/498 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2855 event pairs, 1 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 361. Up to 16 conditions per place. [2025-01-09 16:35:40,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 224 transitions, 475 flow [2025-01-09 16:35:40,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 224 transitions, 475 flow [2025-01-09 16:35:40,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:35:40,549 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;@3f6cfa5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:35:40,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:35:40,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:35:40,554 INFO L124 PetriNetUnfolderBase]: 16/93 cut-off events. [2025-01-09 16:35:40,554 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 16:35:40,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:40,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:40,554 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:40,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:40,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1792133865, now seen corresponding path program 1 times [2025-01-09 16:35:40,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:40,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670612469] [2025-01-09 16:35:40,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:40,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:40,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:35:40,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:35:40,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:40,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:40,586 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:40,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:40,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670612469] [2025-01-09 16:35:40,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670612469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:40,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:40,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:35:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119773378] [2025-01-09 16:35:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:40,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:35:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:40,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:35:40,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:35:40,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 224 [2025-01-09 16:35:40,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 224 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:40,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:40,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 224 [2025-01-09 16:35:40,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand