./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 f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:39:24,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:39:24,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:39:24,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:39:24,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:39:24,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:39:24,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:39:24,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:39:24,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:39:24,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:39:24,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:39:24,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:39:24,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:39:24,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:39:24,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:39:24,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:39:24,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:39:24,343 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2025-03-13 21:39:24,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:39:24,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:39:24,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:39:24,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:39:24,570 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:39:24,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-03-13 21:39:25,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e56b4064/2f3ed954a3334a76bcc561bc9903288b/FLAGe7d32edd4 [2025-03-13 21:39:26,000 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:39:26,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-03-13 21:39:26,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e56b4064/2f3ed954a3334a76bcc561bc9903288b/FLAGe7d32edd4 [2025-03-13 21:39:26,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e56b4064/2f3ed954a3334a76bcc561bc9903288b [2025-03-13 21:39:26,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:39:26,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:39:26,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:39:26,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:39:26,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:39:26,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ce3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26, skipping insertion in model container [2025-03-13 21:39:26,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:39:26,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2025-03-13 21:39:26,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:39:26,374 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:39:26,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2025-03-13 21:39:26,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:39:26,443 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:39:26,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26 WrapperNode [2025-03-13 21:39:26,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:39:26,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:39:26,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:39:26,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:39:26,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,494 INFO L138 Inliner]: procedures = 272, calls = 107, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 308 [2025-03-13 21:39:26,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:39:26,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:39:26,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:39:26,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:39:26,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,525 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-03-13 21:39:26,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:39:26,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:39:26,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:39:26,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:39:26,542 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (1/1) ... [2025-03-13 21:39:26,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:39:26,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:26,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:39:26,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:39:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 21:39:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 21:39:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:39:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:39:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:39:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:39:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-13 21:39:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:39:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:39:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:39:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-13 21:39:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:39:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:39:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 21:39:26,596 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 21:39:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:39:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:39:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:39:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-13 21:39:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:39:26,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:39:26,598 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:39:26,713 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:39:26,714 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:39:27,003 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 21:39:27,004 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-13 21:39:27,061 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:39:27,061 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:39:27,062 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:39:27,372 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:39:27,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:39:27 BoogieIcfgContainer [2025-03-13 21:39:27,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:39:27,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:39:27,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:39:27,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:39:27,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:39:26" (1/3) ... [2025-03-13 21:39:27,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63964a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:39:27, skipping insertion in model container [2025-03-13 21:39:27,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:39:26" (2/3) ... [2025-03-13 21:39:27,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63964a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:39:27, skipping insertion in model container [2025-03-13 21:39:27,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:39:27" (3/3) ... [2025-03-13 21:39:27,379 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-03-13 21:39:27,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:39:27,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 91 locations, 1 initial locations, 17 loop locations, and 3 error locations. [2025-03-13 21:39:27,392 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:39:27,438 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 21:39:27,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 131 transitions, 269 flow [2025-03-13 21:39:27,515 INFO L124 PetriNetUnfolderBase]: 65/212 cut-off events. [2025-03-13 21:39:27,520 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:39:27,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 212 events. 65/212 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 966 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2025-03-13 21:39:27,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 131 transitions, 269 flow [2025-03-13 21:39:27,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 129 transitions, 262 flow [2025-03-13 21:39:27,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:39:27,547 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;@6edee71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:39:27,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:39:27,555 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:39:27,557 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-03-13 21:39:27,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:39:27,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:27,557 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-13 21:39:27,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:39:27,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash 841279288, now seen corresponding path program 1 times [2025-03-13 21:39:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422816262] [2025-03-13 21:39:27,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:27,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:39:27,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:39:27,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:27,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:27,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:27,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422816262] [2025-03-13 21:39:27,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422816262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:27,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:39:27,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:39:27,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600817015] [2025-03-13 21:39:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:27,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:27,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:27,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:39:27,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 131 [2025-03-13 21:39:27,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 129 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:27,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:27,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 131 [2025-03-13 21:39:27,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:28,248 INFO L124 PetriNetUnfolderBase]: 754/2046 cut-off events. [2025-03-13 21:39:28,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:39:28,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3449 conditions, 2046 events. 754/2046 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 14989 event pairs, 612 based on Foata normal form. 442/2252 useless extension candidates. Maximal degree in co-relation 3340. Up to 1398 conditions per place. [2025-03-13 21:39:28,267 INFO L140 encePairwiseOnDemand]: 95/131 looper letters, 57 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2025-03-13 21:39:28,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 97 transitions, 316 flow [2025-03-13 21:39:28,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:39:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:39:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2025-03-13 21:39:28,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5267175572519084 [2025-03-13 21:39:28,283 INFO L175 Difference]: Start difference. First operand has 93 places, 129 transitions, 262 flow. Second operand 3 states and 207 transitions. [2025-03-13 21:39:28,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 97 transitions, 316 flow [2025-03-13 21:39:28,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 97 transitions, 316 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:39:28,292 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 208 flow [2025-03-13 21:39:28,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2025-03-13 21:39:28,297 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 3 predicate places. [2025-03-13 21:39:28,298 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 208 flow [2025-03-13 21:39:28,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:28,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:28,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:28,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:39:28,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:39:28,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash -907532823, now seen corresponding path program 1 times [2025-03-13 21:39:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150250687] [2025-03-13 21:39:28,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:28,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:39:28,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:39:28,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:28,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:28,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:28,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150250687] [2025-03-13 21:39:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150250687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:28,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693977210] [2025-03-13 21:39:28,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:28,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:28,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:28,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:39:28,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:39:28,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:39:28,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:39:28,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:28,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:28,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:39:28,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:28,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693977210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:28,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:39:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015620172] [2025-03-13 21:39:28,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:28,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:39:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:28,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:39:28,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:39:28,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 131 [2025-03-13 21:39:28,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:28,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:28,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 131 [2025-03-13 21:39:28,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:28,930 INFO L124 PetriNetUnfolderBase]: 754/2049 cut-off events. [2025-03-13 21:39:28,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:39:28,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3465 conditions, 2049 events. 754/2049 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 14971 event pairs, 612 based on Foata normal form. 0/1813 useless extension candidates. Maximal degree in co-relation 3453. Up to 1398 conditions per place. [2025-03-13 21:39:28,938 INFO L140 encePairwiseOnDemand]: 128/131 looper letters, 57 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2025-03-13 21:39:28,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 100 transitions, 344 flow [2025-03-13 21:39:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:39:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:39:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 293 transitions. [2025-03-13 21:39:28,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3727735368956743 [2025-03-13 21:39:28,940 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 208 flow. Second operand 6 states and 293 transitions. [2025-03-13 21:39:28,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 100 transitions, 344 flow [2025-03-13 21:39:28,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 100 transitions, 340 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:28,943 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 240 flow [2025-03-13 21:39:28,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2025-03-13 21:39:28,943 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 10 predicate places. [2025-03-13 21:39:28,943 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 240 flow [2025-03-13 21:39:28,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:28,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:28,944 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:28,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:39:29,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:29,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:39:29,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1470657672, now seen corresponding path program 2 times [2025-03-13 21:39:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:29,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133252432] [2025-03-13 21:39:29,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:29,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:29,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:39:29,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:29,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:29,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:29,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:29,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133252432] [2025-03-13 21:39:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133252432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:29,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530181308] [2025-03-13 21:39:29,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:29,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:39:29,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:39:29,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-13 21:39:29,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:29,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:29,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:29,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:39:29,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:29,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530181308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:29,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:29,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:39:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916320036] [2025-03-13 21:39:29,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:29,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:39:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:29,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:39:29,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:39:29,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 131 [2025-03-13 21:39:29,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 240 flow. Second operand has 13 states, 13 states have (on average 39.30769230769231) internal successors, (511), 13 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:29,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:29,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 131 [2025-03-13 21:39:29,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:29,724 INFO L124 PetriNetUnfolderBase]: 754/2055 cut-off events. [2025-03-13 21:39:29,724 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 21:39:29,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 2055 events. 754/2055 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 14987 event pairs, 612 based on Foata normal form. 6/1826 useless extension candidates. Maximal degree in co-relation 3444. Up to 1398 conditions per place. [2025-03-13 21:39:29,733 INFO L140 encePairwiseOnDemand]: 128/131 looper letters, 57 selfloop transitions, 11 changer transitions 0/106 dead transitions. [2025-03-13 21:39:29,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 106 transitions, 412 flow [2025-03-13 21:39:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:39:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:39:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 530 transitions. [2025-03-13 21:39:29,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3371501272264631 [2025-03-13 21:39:29,735 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 240 flow. Second operand 12 states and 530 transitions. [2025-03-13 21:39:29,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 106 transitions, 412 flow [2025-03-13 21:39:29,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 106 transitions, 398 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:29,738 INFO L231 Difference]: Finished difference. Result has 119 places, 106 transitions, 310 flow [2025-03-13 21:39:29,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=310, PETRI_PLACES=119, PETRI_TRANSITIONS=106} [2025-03-13 21:39:29,739 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 26 predicate places. [2025-03-13 21:39:29,739 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 106 transitions, 310 flow [2025-03-13 21:39:29,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 39.30769230769231) internal successors, (511), 13 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:29,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:29,740 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:29,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:39:29,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-13 21:39:29,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:39:29,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 517850584, now seen corresponding path program 3 times [2025-03-13 21:39:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421387648] [2025-03-13 21:39:29,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:39:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:29,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-03-13 21:39:30,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:39:30,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-13 21:39:30,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:30,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:39:30,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:39:30,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:39:30,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:30,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:30,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:39:30,049 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:39:30,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 21:39:30,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-13 21:39:30,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-13 21:39:30,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-13 21:39:30,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-13 21:39:30,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:39:30,052 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-13 21:39:30,053 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:39:30,053 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:39:30,077 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:39:30,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 175 transitions, 366 flow [2025-03-13 21:39:30,100 INFO L124 PetriNetUnfolderBase]: 105/344 cut-off events. [2025-03-13 21:39:30,100 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 21:39:30,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 344 events. 105/344 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1861 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 214. Up to 12 conditions per place. [2025-03-13 21:39:30,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 175 transitions, 366 flow [2025-03-13 21:39:30,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 175 transitions, 366 flow [2025-03-13 21:39:30,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:39:30,106 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;@6edee71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:39:30,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:39:30,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:39:30,112 INFO L124 PetriNetUnfolderBase]: 14/79 cut-off events. [2025-03-13 21:39:30,112 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:39:30,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:30,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:30,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:39:30,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1103909079, now seen corresponding path program 1 times [2025-03-13 21:39:30,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:30,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120285593] [2025-03-13 21:39:30,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:30,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:39:30,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:39:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:30,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120285593] [2025-03-13 21:39:30,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120285593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:30,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:39:30,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:39:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784767291] [2025-03-13 21:39:30,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:30,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:30,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:30,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:39:30,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 175 [2025-03-13 21:39:30,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 175 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:30,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:30,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 175 [2025-03-13 21:39:30,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:33,531 INFO L124 PetriNetUnfolderBase]: 28531/54411 cut-off events. [2025-03-13 21:39:33,532 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-13 21:39:33,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95226 conditions, 54411 events. 28531/54411 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 537358 event pairs, 24302 based on Foata normal form. 12593/60544 useless extension candidates. Maximal degree in co-relation 77457. Up to 40712 conditions per place. [2025-03-13 21:39:33,770 INFO L140 encePairwiseOnDemand]: 128/175 looper letters, 80 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-03-13 21:39:33,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 132 transitions, 444 flow [2025-03-13 21:39:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:39:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:39:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-03-13 21:39:33,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5276190476190477 [2025-03-13 21:39:33,775 INFO L175 Difference]: Start difference. First operand has 126 places, 175 transitions, 366 flow. Second operand 3 states and 277 transitions. [2025-03-13 21:39:33,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 132 transitions, 444 flow [2025-03-13 21:39:33,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 132 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:39:33,781 INFO L231 Difference]: Finished difference. Result has 129 places, 132 transitions, 290 flow [2025-03-13 21:39:33,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=129, PETRI_TRANSITIONS=132} [2025-03-13 21:39:33,782 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 3 predicate places. [2025-03-13 21:39:33,782 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 132 transitions, 290 flow [2025-03-13 21:39:33,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:33,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:33,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:33,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:39:33,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:39:33,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -738264459, now seen corresponding path program 1 times [2025-03-13 21:39:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467260180] [2025-03-13 21:39:33,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:33,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:39:33,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:33,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:33,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:33,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:33,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467260180] [2025-03-13 21:39:33,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467260180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:33,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655781429] [2025-03-13 21:39:33,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:33,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:33,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:33,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:39:33,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:39:33,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:39:33,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:33,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:33,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:33,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 21:39:33,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:39:33,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:39:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655781429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:33,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:39:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-13 21:39:33,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022930203] [2025-03-13 21:39:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:33,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:33,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:33,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:39:33,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 175 [2025-03-13 21:39:33,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 132 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:33,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:33,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 175 [2025-03-13 21:39:33,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:36,456 INFO L124 PetriNetUnfolderBase]: 27706/52349 cut-off events. [2025-03-13 21:39:36,456 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-03-13 21:39:36,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92484 conditions, 52349 events. 27706/52349 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 1704. Compared 515690 event pairs, 11700 based on Foata normal form. 0/46441 useless extension candidates. Maximal degree in co-relation 92471. Up to 40004 conditions per place. [2025-03-13 21:39:36,755 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 101 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-03-13 21:39:36,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 153 transitions, 538 flow [2025-03-13 21:39:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:39:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:39:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-03-13 21:39:36,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4819047619047619 [2025-03-13 21:39:36,756 INFO L175 Difference]: Start difference. First operand has 129 places, 132 transitions, 290 flow. Second operand 3 states and 253 transitions. [2025-03-13 21:39:36,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 153 transitions, 538 flow [2025-03-13 21:39:36,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 153 transitions, 534 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:36,760 INFO L231 Difference]: Finished difference. Result has 131 places, 133 transitions, 298 flow [2025-03-13 21:39:36,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=131, PETRI_TRANSITIONS=133} [2025-03-13 21:39:36,761 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 5 predicate places. [2025-03-13 21:39:36,761 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 133 transitions, 298 flow [2025-03-13 21:39:36,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:36,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:36,761 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:36,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:39:36,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:36,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:39:36,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1315801407, now seen corresponding path program 1 times [2025-03-13 21:39:36,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:36,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377028523] [2025-03-13 21:39:36,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:36,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:39:36,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:36,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:36,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:37,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:37,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377028523] [2025-03-13 21:39:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377028523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214580368] [2025-03-13 21:39:37,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:37,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:37,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:39:37,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:39:37,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:39:37,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:39:37,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:37,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:37,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:39:37,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:37,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214580368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:37,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:39:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229373628] [2025-03-13 21:39:37,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:37,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:39:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:37,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:39:37,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:39:37,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 175 [2025-03-13 21:39:37,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 133 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:37,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:37,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 175 [2025-03-13 21:39:37,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:39,887 INFO L124 PetriNetUnfolderBase]: 28336/55281 cut-off events. [2025-03-13 21:39:39,887 INFO L125 PetriNetUnfolderBase]: For 881/881 co-relation queries the response was YES. [2025-03-13 21:39:39,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96480 conditions, 55281 events. 28336/55281 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 1711. Compared 556356 event pairs, 24301 based on Foata normal form. 3/49301 useless extension candidates. Maximal degree in co-relation 96452. Up to 40304 conditions per place. [2025-03-13 21:39:40,150 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 81 selfloop transitions, 5 changer transitions 0/136 dead transitions. [2025-03-13 21:39:40,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 482 flow [2025-03-13 21:39:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:39:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:39:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 388 transitions. [2025-03-13 21:39:40,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36952380952380953 [2025-03-13 21:39:40,152 INFO L175 Difference]: Start difference. First operand has 131 places, 133 transitions, 298 flow. Second operand 6 states and 388 transitions. [2025-03-13 21:39:40,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 482 flow [2025-03-13 21:39:40,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 136 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:40,156 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 332 flow [2025-03-13 21:39:40,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2025-03-13 21:39:40,158 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 12 predicate places. [2025-03-13 21:39:40,158 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 332 flow [2025-03-13 21:39:40,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:40,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:40,159 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:40,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:39:40,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:40,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:39:40,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash 140990241, now seen corresponding path program 2 times [2025-03-13 21:39:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462034766] [2025-03-13 21:39:40,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:40,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-13 21:39:40,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:39:40,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:40,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:40,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:40,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462034766] [2025-03-13 21:39:40,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462034766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:39:40,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440825501] [2025-03-13 21:39:40,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:39:40,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:40,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:39:40,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:39:40,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:39:40,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-13 21:39:40,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:39:40,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:39:40,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:40,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:39:40,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:39:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:40,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:39:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440825501] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:39:40,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:39:40,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:39:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834802255] [2025-03-13 21:39:40,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:39:40,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:39:40,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:40,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:39:40,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:39:40,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 175 [2025-03-13 21:39:40,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 136 transitions, 332 flow. Second operand has 13 states, 13 states have (on average 51.38461538461539) internal successors, (668), 13 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:40,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:40,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 175 [2025-03-13 21:39:40,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:39:43,576 INFO L124 PetriNetUnfolderBase]: 28336/55287 cut-off events. [2025-03-13 21:39:43,577 INFO L125 PetriNetUnfolderBase]: For 915/915 co-relation queries the response was YES. [2025-03-13 21:39:43,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96500 conditions, 55287 events. 28336/55287 cut-off events. For 915/915 co-relation queries the response was YES. Maximal size of possible extension queue 1711. Compared 556361 event pairs, 24301 based on Foata normal form. 6/49310 useless extension candidates. Maximal degree in co-relation 96440. Up to 40304 conditions per place. [2025-03-13 21:39:43,855 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 81 selfloop transitions, 11 changer transitions 0/142 dead transitions. [2025-03-13 21:39:43,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 142 transitions, 552 flow [2025-03-13 21:39:43,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:39:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:39:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 697 transitions. [2025-03-13 21:39:43,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3319047619047619 [2025-03-13 21:39:43,857 INFO L175 Difference]: Start difference. First operand has 138 places, 136 transitions, 332 flow. Second operand 12 states and 697 transitions. [2025-03-13 21:39:43,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 142 transitions, 552 flow [2025-03-13 21:39:43,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 142 transitions, 538 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:39:43,861 INFO L231 Difference]: Finished difference. Result has 154 places, 142 transitions, 402 flow [2025-03-13 21:39:43,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=402, PETRI_PLACES=154, PETRI_TRANSITIONS=142} [2025-03-13 21:39:43,862 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 28 predicate places. [2025-03-13 21:39:43,862 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 142 transitions, 402 flow [2025-03-13 21:39:43,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.38461538461539) internal successors, (668), 13 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:43,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:43,863 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-03-13 21:39:43,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:39:44,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:39:44,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 21:39:44,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash -380534175, now seen corresponding path program 3 times [2025-03-13 21:39:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374673428] [2025-03-13 21:39:44,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:39:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:44,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-13 21:39:44,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:39:44,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-13 21:39:44,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:44,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:39:44,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:39:44,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:39:44,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:44,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:39:44,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:39:44,134 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:39:44,134 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-13 21:39:44,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-13 21:39:44,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-13 21:39:44,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-13 21:39:44,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-13 21:39:44,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-13 21:39:44,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:39:44,135 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:39:44,135 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:39:44,135 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:39:44,169 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:39:44,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 219 transitions, 465 flow [2025-03-13 21:39:44,197 INFO L124 PetriNetUnfolderBase]: 148/487 cut-off events. [2025-03-13 21:39:44,198 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 21:39:44,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 148/487 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2767 event pairs, 1 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 353. Up to 16 conditions per place. [2025-03-13 21:39:44,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 219 transitions, 465 flow [2025-03-13 21:39:44,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 219 transitions, 465 flow [2025-03-13 21:39:44,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:39:44,207 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;@6edee71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:39:44,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 21:39:44,211 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:39:44,211 INFO L124 PetriNetUnfolderBase]: 14/79 cut-off events. [2025-03-13 21:39:44,211 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:39:44,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:39:44,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:39:44,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:39:44,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:39:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1276417609, now seen corresponding path program 1 times [2025-03-13 21:39:44,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:39:44,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729167094] [2025-03-13 21:39:44,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:39:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:39:44,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:39:44,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:39:44,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:39:44,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:39:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:39:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:39:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729167094] [2025-03-13 21:39:44,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729167094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:39:44,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:39:44,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:39:44,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016738755] [2025-03-13 21:39:44,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:39:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:39:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:39:44,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:39:44,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:39:44,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 219 [2025-03-13 21:39:44,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 219 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:39:44,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:39:44,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 219 [2025-03-13 21:39:44,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand