./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:26:26,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:26:26,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:26:26,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:26:26,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:26:26,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:26:26,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:26:26,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:26:26,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:26:26,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:26:26,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:26:26,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:26:26,647 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:26:26,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:26:26,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:26:26,647 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:26:26,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:26:26,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:26:26,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:26:26,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:26:26,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:26:26,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:26:26,649 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:26:26,649 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:26:26,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:26:26,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:26:26,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:26:26,649 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:26:26,649 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:26:26,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:26,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:26,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:26,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:26:26,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:26,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:26,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:26,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:26:26,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:26:26,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:26:26,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:26:26,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:26:26,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:26:26,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:26:26,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:26:26,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:26:26,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:26:26,652 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) 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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2025-01-09 21:26:26,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:26:26,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:26:26,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:26:26,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:26:26,932 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:26:26,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-01-09 21:26:28,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2d6705bd/9b9fedd33cf34b439d57c5c673b4ac71/FLAGbeeac856c [2025-01-09 21:26:28,508 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:26:28,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-01-09 21:26:28,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2d6705bd/9b9fedd33cf34b439d57c5c673b4ac71/FLAGbeeac856c [2025-01-09 21:26:28,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2d6705bd/9b9fedd33cf34b439d57c5c673b4ac71 [2025-01-09 21:26:28,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:26:28,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:26:28,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:28,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:26:28,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:26:28,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:28" (1/1) ... [2025-01-09 21:26:28,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae6d4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:28, skipping insertion in model container [2025-01-09 21:26:28,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:28" (1/1) ... [2025-01-09 21:26:28,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:26:29,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:29,161 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:26:29,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:29,257 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:26:29,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29 WrapperNode [2025-01-09 21:26:29,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:29,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:29,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:26:29,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:26:29,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,306 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2025-01-09 21:26:29,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:29,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:26:29,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:26:29,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:26:29,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:26:29,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:26:29,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:26:29,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:26:29,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:29,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:26:29,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:26:29,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:26:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:26:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:26:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:26:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:26:29,414 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:26:29,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:26:29,416 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:26:29,555 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:26:29,557 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:26:29,812 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:26:29,813 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:26:29,847 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:26:29,848 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:26:29,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:29 BoogieIcfgContainer [2025-01-09 21:26:29,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:26:29,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:26:29,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:26:29,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:26:29,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:26:28" (1/3) ... [2025-01-09 21:26:29,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e5e7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:29, skipping insertion in model container [2025-01-09 21:26:29,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (2/3) ... [2025-01-09 21:26:29,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e5e7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:29, skipping insertion in model container [2025-01-09 21:26:29,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:29" (3/3) ... [2025-01-09 21:26:29,858 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-01-09 21:26:29,874 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:26:29,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 134 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-01-09 21:26:29,877 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:26:29,948 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:26:29,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 145 transitions, 297 flow [2025-01-09 21:26:30,077 INFO L124 PetriNetUnfolderBase]: 15/202 cut-off events. [2025-01-09 21:26:30,082 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:26:30,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 202 events. 15/202 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 620 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2025-01-09 21:26:30,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 145 transitions, 297 flow [2025-01-09 21:26:30,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 145 transitions, 297 flow [2025-01-09 21:26:30,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:30,118 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;@316c52e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:30,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 21:26:30,137 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:30,138 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-01-09 21:26:30,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:30,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:30,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:30,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:30,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash -435135317, now seen corresponding path program 1 times [2025-01-09 21:26:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:30,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767268409] [2025-01-09 21:26:30,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:30,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:30,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:26:30,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:26:30,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:30,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:30,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:30,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767268409] [2025-01-09 21:26:30,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767268409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:30,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:30,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648546545] [2025-01-09 21:26:30,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:30,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:30,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:30,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 145 [2025-01-09 21:26:30,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 145 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:30,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:30,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 145 [2025-01-09 21:26:30,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:30,722 INFO L124 PetriNetUnfolderBase]: 48/531 cut-off events. [2025-01-09 21:26:30,723 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:26:30,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 531 events. 48/531 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2501 event pairs, 35 based on Foata normal form. 54/530 useless extension candidates. Maximal degree in co-relation 575. Up to 108 conditions per place. [2025-01-09 21:26:30,731 INFO L140 encePairwiseOnDemand]: 132/145 looper letters, 22 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2025-01-09 21:26:30,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 139 transitions, 333 flow [2025-01-09 21:26:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-01-09 21:26:30,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8942528735632184 [2025-01-09 21:26:30,751 INFO L175 Difference]: Start difference. First operand has 137 places, 145 transitions, 297 flow. Second operand 3 states and 389 transitions. [2025-01-09 21:26:30,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 139 transitions, 333 flow [2025-01-09 21:26:30,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 139 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:30,762 INFO L231 Difference]: Finished difference. Result has 138 places, 133 transitions, 281 flow [2025-01-09 21:26:30,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=138, PETRI_TRANSITIONS=133} [2025-01-09 21:26:30,769 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 1 predicate places. [2025-01-09 21:26:30,770 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 133 transitions, 281 flow [2025-01-09 21:26:30,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:30,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:30,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:30,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:26:30,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash 455857562, now seen corresponding path program 1 times [2025-01-09 21:26:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389624905] [2025-01-09 21:26:30,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:30,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:26:30,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:26:30,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:30,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:31,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:31,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389624905] [2025-01-09 21:26:31,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389624905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:31,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:31,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956457958] [2025-01-09 21:26:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:31,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:31,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:31,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:31,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 145 [2025-01-09 21:26:31,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 133 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:31,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 145 [2025-01-09 21:26:31,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:31,740 INFO L124 PetriNetUnfolderBase]: 108/637 cut-off events. [2025-01-09 21:26:31,741 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:26:31,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 637 events. 108/637 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3639 event pairs, 7 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 831. Up to 181 conditions per place. [2025-01-09 21:26:31,746 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 48 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-01-09 21:26:31,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 433 flow [2025-01-09 21:26:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2025-01-09 21:26:31,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7793103448275862 [2025-01-09 21:26:31,749 INFO L175 Difference]: Start difference. First operand has 138 places, 133 transitions, 281 flow. Second operand 6 states and 678 transitions. [2025-01-09 21:26:31,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 433 flow [2025-01-09 21:26:31,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 156 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:31,753 INFO L231 Difference]: Finished difference. Result has 140 places, 132 transitions, 285 flow [2025-01-09 21:26:31,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=140, PETRI_TRANSITIONS=132} [2025-01-09 21:26:31,754 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 3 predicate places. [2025-01-09 21:26:31,754 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 132 transitions, 285 flow [2025-01-09 21:26:31,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:31,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:31,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:26:31,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:31,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash -325238692, now seen corresponding path program 1 times [2025-01-09 21:26:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:31,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313846329] [2025-01-09 21:26:31,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:31,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:26:31,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:26:31,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:31,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:31,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313846329] [2025-01-09 21:26:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313846329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:31,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:31,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:31,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214748007] [2025-01-09 21:26:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:31,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:31,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:31,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:31,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:31,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 145 [2025-01-09 21:26:31,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 132 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:31,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 145 [2025-01-09 21:26:31,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:31,966 INFO L124 PetriNetUnfolderBase]: 91/795 cut-off events. [2025-01-09 21:26:31,966 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:26:31,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 795 events. 91/795 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4685 event pairs, 30 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 962. Up to 125 conditions per place. [2025-01-09 21:26:31,970 INFO L140 encePairwiseOnDemand]: 136/145 looper letters, 30 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2025-01-09 21:26:31,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 145 transitions, 386 flow [2025-01-09 21:26:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-01-09 21:26:31,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8551724137931035 [2025-01-09 21:26:31,971 INFO L175 Difference]: Start difference. First operand has 140 places, 132 transitions, 285 flow. Second operand 3 states and 372 transitions. [2025-01-09 21:26:31,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 145 transitions, 386 flow [2025-01-09 21:26:31,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 376 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:26:31,975 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 313 flow [2025-01-09 21:26:31,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2025-01-09 21:26:31,975 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2025-01-09 21:26:31,975 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 313 flow [2025-01-09 21:26:31,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:31,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:31,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:26:31,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:31,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1499023067, now seen corresponding path program 1 times [2025-01-09 21:26:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:31,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612759210] [2025-01-09 21:26:31,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:31,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:26:31,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:26:31,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:31,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612759210] [2025-01-09 21:26:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612759210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119226082] [2025-01-09 21:26:32,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:32,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:32,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:32,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:32,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:32,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 145 [2025-01-09 21:26:32,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 134 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:32,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:32,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 145 [2025-01-09 21:26:32,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:32,196 INFO L124 PetriNetUnfolderBase]: 94/797 cut-off events. [2025-01-09 21:26:32,196 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-09 21:26:32,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 797 events. 94/797 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4794 event pairs, 60 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 1062. Up to 189 conditions per place. [2025-01-09 21:26:32,200 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 27 selfloop transitions, 4 changer transitions 0/141 dead transitions. [2025-01-09 21:26:32,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 141 transitions, 393 flow [2025-01-09 21:26:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-01-09 21:26:32,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8459770114942529 [2025-01-09 21:26:32,203 INFO L175 Difference]: Start difference. First operand has 137 places, 134 transitions, 313 flow. Second operand 3 states and 368 transitions. [2025-01-09 21:26:32,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 141 transitions, 393 flow [2025-01-09 21:26:32,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 141 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:32,209 INFO L231 Difference]: Finished difference. Result has 139 places, 137 transitions, 333 flow [2025-01-09 21:26:32,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=139, PETRI_TRANSITIONS=137} [2025-01-09 21:26:32,210 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2025-01-09 21:26:32,210 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 137 transitions, 333 flow [2025-01-09 21:26:32,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:32,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:32,210 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:32,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:26:32,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:32,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash -577036328, now seen corresponding path program 1 times [2025-01-09 21:26:32,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:32,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069031479] [2025-01-09 21:26:32,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:32,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:32,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:26:32,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:26:32,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:32,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:32,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:32,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:26:32,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:26:32,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:32,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:32,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:26:32,278 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:26:32,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-01-09 21:26:32,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-01-09 21:26:32,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-01-09 21:26:32,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:26:32,284 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:26:32,288 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:26:32,289 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:26:32,325 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:26:32,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 194 transitions, 404 flow [2025-01-09 21:26:32,365 INFO L124 PetriNetUnfolderBase]: 27/335 cut-off events. [2025-01-09 21:26:32,366 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:26:32,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 335 events. 27/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1158 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 204. Up to 6 conditions per place. [2025-01-09 21:26:32,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 194 transitions, 404 flow [2025-01-09 21:26:32,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 194 transitions, 404 flow [2025-01-09 21:26:32,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:32,375 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;@316c52e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:32,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:26:32,382 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:32,383 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-01-09 21:26:32,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:32,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:32,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:32,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:32,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:32,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1650483627, now seen corresponding path program 1 times [2025-01-09 21:26:32,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:32,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681930548] [2025-01-09 21:26:32,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:32,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:32,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:26:32,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:26:32,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:32,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681930548] [2025-01-09 21:26:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681930548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689388261] [2025-01-09 21:26:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:32,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:32,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:32,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:32,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 194 [2025-01-09 21:26:32,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 194 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:32,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:32,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 194 [2025-01-09 21:26:32,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:33,116 INFO L124 PetriNetUnfolderBase]: 788/4305 cut-off events. [2025-01-09 21:26:33,116 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-09 21:26:33,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5658 conditions, 4305 events. 788/4305 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 41078 event pairs, 348 based on Foata normal form. 693/4612 useless extension candidates. Maximal degree in co-relation 721. Up to 1303 conditions per place. [2025-01-09 21:26:33,141 INFO L140 encePairwiseOnDemand]: 175/194 looper letters, 31 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-01-09 21:26:33,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 183 transitions, 448 flow [2025-01-09 21:26:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-01-09 21:26:33,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8745704467353952 [2025-01-09 21:26:33,148 INFO L175 Difference]: Start difference. First operand has 181 places, 194 transitions, 404 flow. Second operand 3 states and 509 transitions. [2025-01-09 21:26:33,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 183 transitions, 448 flow [2025-01-09 21:26:33,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 183 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:33,152 INFO L231 Difference]: Finished difference. Result has 182 places, 177 transitions, 380 flow [2025-01-09 21:26:33,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=182, PETRI_TRANSITIONS=177} [2025-01-09 21:26:33,153 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 1 predicate places. [2025-01-09 21:26:33,154 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 177 transitions, 380 flow [2025-01-09 21:26:33,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:33,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:33,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:33,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:26:33,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:33,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1014058278, now seen corresponding path program 1 times [2025-01-09 21:26:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842716744] [2025-01-09 21:26:33,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:33,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:33,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:26:33,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:26:33,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:33,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:33,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:33,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842716744] [2025-01-09 21:26:33,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842716744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:33,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877196141] [2025-01-09 21:26:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:33,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:33,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:33,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:33,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 194 [2025-01-09 21:26:33,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 177 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:33,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:33,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 194 [2025-01-09 21:26:33,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:34,362 INFO L124 PetriNetUnfolderBase]: 1718/5680 cut-off events. [2025-01-09 21:26:34,362 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-01-09 21:26:34,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8692 conditions, 5680 events. 1718/5680 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 53894 event pairs, 222 based on Foata normal form. 0/5288 useless extension candidates. Maximal degree in co-relation 1233. Up to 2015 conditions per place. [2025-01-09 21:26:34,409 INFO L140 encePairwiseOnDemand]: 188/194 looper letters, 80 selfloop transitions, 6 changer transitions 0/224 dead transitions. [2025-01-09 21:26:34,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 224 transitions, 646 flow [2025-01-09 21:26:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2025-01-09 21:26:34,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7903780068728522 [2025-01-09 21:26:34,413 INFO L175 Difference]: Start difference. First operand has 182 places, 177 transitions, 380 flow. Second operand 6 states and 920 transitions. [2025-01-09 21:26:34,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 224 transitions, 646 flow [2025-01-09 21:26:34,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 224 transitions, 644 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:26:34,419 INFO L231 Difference]: Finished difference. Result has 185 places, 176 transitions, 388 flow [2025-01-09 21:26:34,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=388, PETRI_PLACES=185, PETRI_TRANSITIONS=176} [2025-01-09 21:26:34,420 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 4 predicate places. [2025-01-09 21:26:34,420 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 176 transitions, 388 flow [2025-01-09 21:26:34,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:34,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:34,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:34,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:26:34,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash -987902963, now seen corresponding path program 1 times [2025-01-09 21:26:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593669796] [2025-01-09 21:26:34,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:34,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:26:34,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:26:34,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:34,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:34,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:34,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593669796] [2025-01-09 21:26:34,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593669796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:34,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:34,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102960604] [2025-01-09 21:26:34,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:34,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:34,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:34,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:34,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 194 [2025-01-09 21:26:34,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 176 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:34,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:34,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 194 [2025-01-09 21:26:34,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:36,046 INFO L124 PetriNetUnfolderBase]: 3893/14603 cut-off events. [2025-01-09 21:26:36,046 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-01-09 21:26:36,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21154 conditions, 14603 events. 3893/14603 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 164107 event pairs, 1530 based on Foata normal form. 0/13062 useless extension candidates. Maximal degree in co-relation 20044. Up to 3516 conditions per place. [2025-01-09 21:26:36,131 INFO L140 encePairwiseOnDemand]: 175/194 looper letters, 58 selfloop transitions, 14 changer transitions 0/209 dead transitions. [2025-01-09 21:26:36,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 209 transitions, 609 flow [2025-01-09 21:26:36,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2025-01-09 21:26:36,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8436426116838488 [2025-01-09 21:26:36,134 INFO L175 Difference]: Start difference. First operand has 185 places, 176 transitions, 388 flow. Second operand 3 states and 491 transitions. [2025-01-09 21:26:36,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 209 transitions, 609 flow [2025-01-09 21:26:36,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 209 transitions, 597 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:26:36,138 INFO L231 Difference]: Finished difference. Result has 184 places, 190 transitions, 498 flow [2025-01-09 21:26:36,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=184, PETRI_TRANSITIONS=190} [2025-01-09 21:26:36,138 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 3 predicate places. [2025-01-09 21:26:36,139 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 190 transitions, 498 flow [2025-01-09 21:26:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:36,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:36,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:36,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:26:36,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:36,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash 998920716, now seen corresponding path program 1 times [2025-01-09 21:26:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:36,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857234626] [2025-01-09 21:26:36,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:36,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:26:36,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:26:36,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:36,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857234626] [2025-01-09 21:26:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857234626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:36,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:36,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:36,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790250857] [2025-01-09 21:26:36,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:36,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:36,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:36,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:36,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 194 [2025-01-09 21:26:36,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 190 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:36,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:36,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 194 [2025-01-09 21:26:36,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:37,790 INFO L124 PetriNetUnfolderBase]: 4020/16456 cut-off events. [2025-01-09 21:26:37,790 INFO L125 PetriNetUnfolderBase]: For 4434/4609 co-relation queries the response was YES. [2025-01-09 21:26:37,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27144 conditions, 16456 events. 4020/16456 cut-off events. For 4434/4609 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 193915 event pairs, 2411 based on Foata normal form. 46/14958 useless extension candidates. Maximal degree in co-relation 13739. Up to 5498 conditions per place. [2025-01-09 21:26:37,894 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 52 selfloop transitions, 14 changer transitions 0/214 dead transitions. [2025-01-09 21:26:37,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 214 transitions, 716 flow [2025-01-09 21:26:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-01-09 21:26:37,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-01-09 21:26:37,896 INFO L175 Difference]: Start difference. First operand has 184 places, 190 transitions, 498 flow. Second operand 3 states and 485 transitions. [2025-01-09 21:26:37,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 214 transitions, 716 flow [2025-01-09 21:26:37,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 214 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:37,909 INFO L231 Difference]: Finished difference. Result has 186 places, 202 transitions, 596 flow [2025-01-09 21:26:37,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=186, PETRI_TRANSITIONS=202} [2025-01-09 21:26:37,910 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 5 predicate places. [2025-01-09 21:26:37,910 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 202 transitions, 596 flow [2025-01-09 21:26:37,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:37,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:37,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:37,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:26:37,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:37,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:37,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1826536018, now seen corresponding path program 1 times [2025-01-09 21:26:37,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058005375] [2025-01-09 21:26:37,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:37,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:26:37,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:26:37,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:37,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:26:38,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:38,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058005375] [2025-01-09 21:26:38,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058005375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:38,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:38,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:38,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274503490] [2025-01-09 21:26:38,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:38,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:26:38,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:38,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:26:38,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:26:38,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194 [2025-01-09 21:26:38,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 202 transitions, 596 flow. Second operand has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:38,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:38,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194 [2025-01-09 21:26:38,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:39,565 INFO L124 PetriNetUnfolderBase]: 3063/17780 cut-off events. [2025-01-09 21:26:39,565 INFO L125 PetriNetUnfolderBase]: For 1413/1927 co-relation queries the response was YES. [2025-01-09 21:26:39,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25245 conditions, 17780 events. 3063/17780 cut-off events. For 1413/1927 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 231901 event pairs, 741 based on Foata normal form. 16/15959 useless extension candidates. Maximal degree in co-relation 21477. Up to 3818 conditions per place. [2025-01-09 21:26:39,656 INFO L140 encePairwiseOnDemand]: 189/194 looper letters, 56 selfloop transitions, 5 changer transitions 0/234 dead transitions. [2025-01-09 21:26:39,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 234 transitions, 782 flow [2025-01-09 21:26:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 956 transitions. [2025-01-09 21:26:39,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8213058419243986 [2025-01-09 21:26:39,660 INFO L175 Difference]: Start difference. First operand has 186 places, 202 transitions, 596 flow. Second operand 6 states and 956 transitions. [2025-01-09 21:26:39,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 234 transitions, 782 flow [2025-01-09 21:26:39,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 234 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:39,671 INFO L231 Difference]: Finished difference. Result has 192 places, 204 transitions, 594 flow [2025-01-09 21:26:39,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=594, PETRI_PLACES=192, PETRI_TRANSITIONS=204} [2025-01-09 21:26:39,672 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 11 predicate places. [2025-01-09 21:26:39,672 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 204 transitions, 594 flow [2025-01-09 21:26:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:39,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:39,673 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:39,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:26:39,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:39,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1912290244, now seen corresponding path program 1 times [2025-01-09 21:26:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542024360] [2025-01-09 21:26:39,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:39,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:26:39,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:26:39,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:39,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:26:39,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542024360] [2025-01-09 21:26:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542024360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:39,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:39,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862120935] [2025-01-09 21:26:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:39,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:39,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:39,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:39,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:39,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 194 [2025-01-09 21:26:39,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 204 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:39,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:39,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 194 [2025-01-09 21:26:39,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:41,540 INFO L124 PetriNetUnfolderBase]: 4656/19920 cut-off events. [2025-01-09 21:26:41,540 INFO L125 PetriNetUnfolderBase]: For 5229/5431 co-relation queries the response was YES. [2025-01-09 21:26:41,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32445 conditions, 19920 events. 4656/19920 cut-off events. For 5229/5431 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 247925 event pairs, 2716 based on Foata normal form. 35/17903 useless extension candidates. Maximal degree in co-relation 32254. Up to 6266 conditions per place. [2025-01-09 21:26:41,615 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 59 selfloop transitions, 17 changer transitions 0/228 dead transitions. [2025-01-09 21:26:41,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 228 transitions, 829 flow [2025-01-09 21:26:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-01-09 21:26:41,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8316151202749141 [2025-01-09 21:26:41,618 INFO L175 Difference]: Start difference. First operand has 192 places, 204 transitions, 594 flow. Second operand 3 states and 484 transitions. [2025-01-09 21:26:41,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 228 transitions, 829 flow [2025-01-09 21:26:41,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 228 transitions, 823 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:41,623 INFO L231 Difference]: Finished difference. Result has 194 places, 217 transitions, 742 flow [2025-01-09 21:26:41,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=194, PETRI_TRANSITIONS=217} [2025-01-09 21:26:41,624 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 13 predicate places. [2025-01-09 21:26:41,624 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 217 transitions, 742 flow [2025-01-09 21:26:41,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:41,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:41,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:41,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:26:41,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:41,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:41,626 INFO L85 PathProgramCache]: Analyzing trace with hash -984003207, now seen corresponding path program 1 times [2025-01-09 21:26:41,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215405023] [2025-01-09 21:26:41,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:41,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:26:41,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:26:41,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:41,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:26:41,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:41,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215405023] [2025-01-09 21:26:41,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215405023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:41,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:41,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:41,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369251844] [2025-01-09 21:26:41,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:41,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:41,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:41,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:41,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:41,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 194 [2025-01-09 21:26:41,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 217 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:41,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:41,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 194 [2025-01-09 21:26:41,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:43,383 INFO L124 PetriNetUnfolderBase]: 5232/22430 cut-off events. [2025-01-09 21:26:43,383 INFO L125 PetriNetUnfolderBase]: For 13216/13640 co-relation queries the response was YES. [2025-01-09 21:26:43,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39638 conditions, 22430 events. 5232/22430 cut-off events. For 13216/13640 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 284594 event pairs, 2910 based on Foata normal form. 60/20201 useless extension candidates. Maximal degree in co-relation 39426. Up to 7048 conditions per place. [2025-01-09 21:26:43,479 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 71 selfloop transitions, 17 changer transitions 0/242 dead transitions. [2025-01-09 21:26:43,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 242 transitions, 1036 flow [2025-01-09 21:26:43,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-01-09 21:26:43,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-01-09 21:26:43,481 INFO L175 Difference]: Start difference. First operand has 194 places, 217 transitions, 742 flow. Second operand 3 states and 485 transitions. [2025-01-09 21:26:43,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 242 transitions, 1036 flow [2025-01-09 21:26:43,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 242 transitions, 996 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:43,499 INFO L231 Difference]: Finished difference. Result has 196 places, 230 transitions, 884 flow [2025-01-09 21:26:43,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=196, PETRI_TRANSITIONS=230} [2025-01-09 21:26:43,500 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 15 predicate places. [2025-01-09 21:26:43,500 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 230 transitions, 884 flow [2025-01-09 21:26:43,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:43,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:43,501 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:43,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:26:43,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:43,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1437665265, now seen corresponding path program 1 times [2025-01-09 21:26:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:43,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935852451] [2025-01-09 21:26:43,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:43,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:26:43,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:26:43,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:43,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:43,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:43,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:26:43,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:26:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:43,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:26:43,549 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:26:43,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-09 21:26:43,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-01-09 21:26:43,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-01-09 21:26:43,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-01-09 21:26:43,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-01-09 21:26:43,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-01-09 21:26:43,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-01-09 21:26:43,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:26:43,552 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:43,552 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:26:43,552 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:26:43,593 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:26:43,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 243 transitions, 513 flow [2025-01-09 21:26:43,649 INFO L124 PetriNetUnfolderBase]: 42/511 cut-off events. [2025-01-09 21:26:43,649 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:26:43,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 511 events. 42/511 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1958 event pairs, 1 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 343. Up to 12 conditions per place. [2025-01-09 21:26:43,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 243 transitions, 513 flow [2025-01-09 21:26:43,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 243 transitions, 513 flow [2025-01-09 21:26:43,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:43,657 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;@316c52e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:43,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 21:26:43,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:43,661 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-01-09 21:26:43,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:43,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:43,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:43,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:43,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash 145027371, now seen corresponding path program 1 times [2025-01-09 21:26:43,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:43,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757053257] [2025-01-09 21:26:43,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:43,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:43,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:26:43,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:26:43,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:43,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:43,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757053257] [2025-01-09 21:26:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757053257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:43,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:43,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:43,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958545134] [2025-01-09 21:26:43,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:43,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:43,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:43,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:43,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 243 [2025-01-09 21:26:43,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 243 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:43,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:43,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 243 [2025-01-09 21:26:43,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:46,872 INFO L124 PetriNetUnfolderBase]: 8948/35254 cut-off events. [2025-01-09 21:26:46,873 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2025-01-09 21:26:46,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48492 conditions, 35254 events. 8948/35254 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 458518 event pairs, 5659 based on Foata normal form. 7139/39170 useless extension candidates. Maximal degree in co-relation 6249. Up to 12802 conditions per place. [2025-01-09 21:26:47,051 INFO L140 encePairwiseOnDemand]: 218/243 looper letters, 39 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2025-01-09 21:26:47,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 226 transitions, 561 flow [2025-01-09 21:26:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2025-01-09 21:26:47,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8614540466392319 [2025-01-09 21:26:47,054 INFO L175 Difference]: Start difference. First operand has 225 places, 243 transitions, 513 flow. Second operand 3 states and 628 transitions. [2025-01-09 21:26:47,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 226 transitions, 561 flow [2025-01-09 21:26:47,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 226 transitions, 561 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:47,059 INFO L231 Difference]: Finished difference. Result has 226 places, 220 transitions, 477 flow [2025-01-09 21:26:47,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=226, PETRI_TRANSITIONS=220} [2025-01-09 21:26:47,061 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, 1 predicate places. [2025-01-09 21:26:47,061 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 220 transitions, 477 flow [2025-01-09 21:26:47,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:47,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:47,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:47,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:26:47,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:47,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:47,062 INFO L85 PathProgramCache]: Analyzing trace with hash -353533766, now seen corresponding path program 1 times [2025-01-09 21:26:47,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:47,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431219972] [2025-01-09 21:26:47,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:47,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:47,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:26:47,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:26:47,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:47,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:47,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431219972] [2025-01-09 21:26:47,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431219972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:47,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:47,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174731484] [2025-01-09 21:26:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:47,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:47,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:47,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:47,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 243 [2025-01-09 21:26:47,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 220 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:47,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:47,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 243 [2025-01-09 21:26:47,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:52,375 INFO L124 PetriNetUnfolderBase]: 19555/51762 cut-off events. [2025-01-09 21:26:52,376 INFO L125 PetriNetUnfolderBase]: For 1427/1427 co-relation queries the response was YES. [2025-01-09 21:26:52,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80922 conditions, 51762 events. 19555/51762 cut-off events. For 1427/1427 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 630934 event pairs, 2086 based on Foata normal form. 0/48276 useless extension candidates. Maximal degree in co-relation 57667. Up to 20048 conditions per place. [2025-01-09 21:26:52,678 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 112 selfloop transitions, 6 changer transitions 0/291 dead transitions. [2025-01-09 21:26:52,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 291 transitions, 855 flow [2025-01-09 21:26:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1162 transitions. [2025-01-09 21:26:52,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7969821673525377 [2025-01-09 21:26:52,681 INFO L175 Difference]: Start difference. First operand has 226 places, 220 transitions, 477 flow. Second operand 6 states and 1162 transitions. [2025-01-09 21:26:52,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 291 transitions, 855 flow [2025-01-09 21:26:52,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 291 transitions, 853 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:26:52,686 INFO L231 Difference]: Finished difference. Result has 229 places, 219 transitions, 485 flow [2025-01-09 21:26:52,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=229, PETRI_TRANSITIONS=219} [2025-01-09 21:26:52,687 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, 4 predicate places. [2025-01-09 21:26:52,687 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 219 transitions, 485 flow [2025-01-09 21:26:52,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:52,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:52,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:52,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:26:52,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:52,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1100665295, now seen corresponding path program 1 times [2025-01-09 21:26:52,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:52,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96715826] [2025-01-09 21:26:52,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:52,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:26:52,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:26:52,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:52,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:52,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:52,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96715826] [2025-01-09 21:26:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96715826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:52,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028376528] [2025-01-09 21:26:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:52,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:52,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:52,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 243 [2025-01-09 21:26:52,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 219 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:52,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:52,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 243 [2025-01-09 21:26:52,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand